Abstract
In this paper, the effects on the signless Laplacian spectral radius of a graph are studied when some operations, such as edge moving, edge subdividing, are applied to the graph. Moreover, the largest signless Laplacian spectral radius among the all unicyclic graphs with n vertices and k pendant vertices is identified. Furthermore, we determine the graphs with the largest Laplacian spectral radii among the all unicyclic graphs and bicyclic graphs with n vertices and k pendant vertices, respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.A. Brualdi, E. S. Solheid: On the spectral radius of connected graphs. Publ. Inst. Math. Beograd 39(53) (1986), 45–54.
D.M. Cardoso, D. Cvetković, P. Rowlinson, S.K. Simić: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph. Linear Algebra Appl. 429 (2008), 2770–2780.
D.M. Cvetković, M. Doob, H. Sachs: Spectra of Graphs. Theory and Applications. VEB Deutscher Verlag der Wissenschaften, Berlin, 1980.
D.M. Cvetković, P. Rowlinson, S. Simić: Eigenspaces of Graphs. Cambridge University Press, Cambridge, 1997, pp. 56–60.
D. Cvetković, P. Rowlinson, S.K. Simić: Signless Laplacians of finite graphs. Linear Algebra Appl. 423 (2007), 155–171.
X.Y. Geng, S.C. Li: The spectral radius of tricyclic graphs with n vertices and k pendant vertices. Linear Algebra Appl. 428 (2008), 2639–2653.
J.W. Grossman, D.M. Kulkarni, I. E. Schochetman: Algebraic graph theory without orientation. Linear Algebra Appl. 212–213 (1994), 289–307.
J.M. Guo: The effect on the Laplacian spectral radius of a graph by adding or grafting edges. Linear Algebra Appl. 413 (2006), 59–71.
S.G. Guo: The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices. Linear Algebra Appl. 408 (2005), 78–85.
J. van den Heuvel: Hamilton cycles and eigenvalues of graphs. Linear Algebra Appl. 226–228 (1995), 723–730.
J. S. Li, X.-D. Zhang: On the Laplacian eigenvalues of a graph. Linear Algebra Appl. 285 (1998), 305–307.
Q. Li, K. Feng: On the largest eigenvalue of a graph. Acta. Math. Appl. Sinica 2 (1979), 167–175. (In Chinese.)
B. L. Liu: Combinatorial Matrix Theory. Science Press, Beijing, 2005. (In Chinese.)
R. Merris: Laplacian matrices of graphs: A survey. Linear Algebra Appl. 197–198 (1994), 143–176.
Y. L. Pan: Sharp upper bounds for the Laplacian graph eigenvalues. Linear Algebra Appl. 355 (2002), 287–295.
O. Rojo, R. Soto, H. Rojo: An always nontrivial upper bound for Laplacian graph eigenvalues. Linear Algebra Appl. 312 (2000), 155–159.
B. Wu, E. Xiao, Y. Hong: The spectral radius of trees on k pendant vertices. Linear Algebra Appl. 395 (2005), 343–349.
X.D. Zhang: The Laplacian spectral radii of trees with degree sequences. Discrete Math. 308 (2008), 3143–3150.
Author information
Authors and Affiliations
Corresponding author
Additional information
The first author was supported by the fund of South China Agricultural University (No. 4900-k08225). The third author was supported by NNSF of China (No. 10771080) and SRFDP of China (No. 20070574006).
Rights and permissions
About this article
Cite this article
Liu, M., Tan, X. & Liu, B. The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices. Czech Math J 60, 849–867 (2010). https://doi.org/10.1007/s10587-010-0053-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-010-0053-z