![](/images/graphics-bg.png)
The Least Algebraic Connectivity of Graphs
Joint Authors
Cao, Jinde
Yu, Guidong
Jiang, Guisheng
Source
Discrete Dynamics in Nature and Society
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-10-04
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected.
In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees, but not stars, and among all graphs whose complements are unicyclic graphs, but not stars adding one edge, respectively.
American Psychological Association (APA)
Jiang, Guisheng& Yu, Guidong& Cao, Jinde. 2015. The Least Algebraic Connectivity of Graphs. Discrete Dynamics in Nature and Society،Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1060760
Modern Language Association (MLA)
Jiang, Guisheng…[et al.]. The Least Algebraic Connectivity of Graphs. Discrete Dynamics in Nature and Society No. 2015 (2015), pp.1-9.
https://search.emarefa.net/detail/BIM-1060760
American Medical Association (AMA)
Jiang, Guisheng& Yu, Guidong& Cao, Jinde. The Least Algebraic Connectivity of Graphs. Discrete Dynamics in Nature and Society. 2015. Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1060760
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1060760