The Laplacian Spectral Radius of a Class of Unicyclic Graphs
LetC(n,k)be the set of all unicyclic graphs withnvertices and cycle lengthk. For anyU∈C(n,k),Uconsists of the (unique) cycle (sayCk) of lengthkand a certain number of trees attached to the vertices ofCkhaving (in total)n-kedges. If there are at most two trees attached to the vertices ofCk, wherekis even, we identify in the class of unicyclic graphs those graphs whose Laplacian spectral radii are minimal.
2013 ◽
Vol 63
(4)
◽
pp. 909-922
◽
2009 ◽
Vol 49
(1)
◽
pp. 123-131
◽
2015 ◽
Vol 97
(111)
◽
pp. 187-197
◽
2010 ◽
Vol 433
(5)
◽
pp. 934-944
◽
2013 ◽
Vol 438
(10)
◽
pp. 3851-3861
◽
2016 ◽
Vol 65
(4)
◽
pp. 830-839
◽
2010 ◽
Vol 433
(5)
◽
pp. 928-933
◽