arXiv Analytics

Sign in

arXiv:1306.4649 [math.CO]AbstractReferencesReviewsResources

On the characteristic polynomial of Laplacian Matrices of Caterpillars

D. M. Cardoso, M. A. A. de Freitas, E. A. Martins, M. Robbinao, B. San Martín

Published 2013-06-19Version 1

The characteristic polynomials of the adjacency matrix of line graphs of caterpillars and then the characteristic polynomials of their Laplacian or signless Laplacian matrices are characterized, using recursive formulas. Furthermore, the obtained results are applied on the determination of upper and lower bounds on the algebraic connectivity of these graphs.

Comments: 24 pages, 1 figure
Categories: math.CO
Subjects: 05C50, 15A18
Related articles: Most relevant | Search more
arXiv:2407.02535 [math.CO] (Published 2024-07-01)
Eccentricity and algebraic connectivity of graphs
arXiv:2201.04225 [math.CO] (Published 2022-01-11)
New conjectures on algebraic connectivity and the Laplacian spread of graphs
arXiv:1603.03960 [math.CO] (Published 2016-03-12)
Algebraic connectivity of multigraphs

Links

Toolbox