The largest eigenvalue of unicyclic graphs

DOI10.1016/J.DISC.2006.06.023zbMath1116.05050OpenAlexW2052353854MaRDI QIDQ864171

Shengbiao Hu

Publication date: 13 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.023

zbMATH Keywords

adjacency matrixLaplacian matrix

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Locating eigenvalues of unicyclic graphs ⋮ Unnamed Item ⋮ New upper bounds on the spectral radius of unicyclic graphs ⋮ Locating eigenvalues of unbalanced unicyclic signed graphs ⋮ On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree ⋮ On the α-spectral radius of graphs

Cites Work

• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• A relation between the matching number and Laplacian spectrum of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: The largest eigenvalue of unicyclic graphs