The Laplacian Spectral Radius of a Class of Unicyclic Graphs
Author
Source
Journal of Applied Mathematics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-12-18
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k.
For any U∈C(n,k), U consists of the (unique) cycle (say Ck) of length k and a certain number of trees attached to the vertices of Ck having (in total) n-k edges.
If there are at most two trees attached to the vertices of Ck, where k is even, we identify in the class of unicyclic graphs those graphs whose Laplacian spectral radii are minimal.
American Psychological Association (APA)
Zhang, Haixia. 2013. The Laplacian Spectral Radius of a Class of Unicyclic Graphs. Journal of Applied Mathematics،Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-494097
Modern Language Association (MLA)
Zhang, Haixia. The Laplacian Spectral Radius of a Class of Unicyclic Graphs. Journal of Applied Mathematics No. 2013 (2013), pp.1-6.
https://search.emarefa.net/detail/BIM-494097
American Medical Association (AMA)
Zhang, Haixia. The Laplacian Spectral Radius of a Class of Unicyclic Graphs. Journal of Applied Mathematics. 2013. Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-494097
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-494097