The Laplacian Spectral Radius of a Class of Unicyclic Graphs

Haixia Zhang

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/730396

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:730396

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().