The Laplacian Spectral Radius of a Class of Unicyclic Graphs

Haixia Zhang

Journal of Applied Mathematics, 2013, vol. 2013, 1-6

Abstract:

Let be the set of all unicyclic graphs with vertices and cycle length . For any , consists of the (unique) cycle (say ) of length and a certain number of trees attached to the vertices of having (in total) edges. If there are at most two trees attached to the vertices of , where 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)
http://downloads.hindawi.com/journals/JAM/2013/730396.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/730396.xml (text/xml)

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:hin:jnljam:730396

DOI: 10.1155/2013/730396

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().