SPECTRAL RADII OF UNICYCLIC GRAPHS WITH FIXED NUMBER OF CUT VERTICES

DOI10.1142/S179383091100119XzbMath1408.05080OpenAlexW1979789076MaRDI QIDQ3087089

Yi-Zheng Fan, Jingmei Zhang, Yi Wang

Publication date: 2 August 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091100119x

zbMATH Keywords

spectral radiusunicyclic graphcut vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Related Items (2)

On spectral radius of graphs with pendant paths ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)

Cites Work

• On the spectral radius of unicyclic graphs with fixed diameter
• On the spectral radii of unicyclic graphs with fixed matching number
• Spectra of unicyclic graphs
• Bounds on the largest eigenvalues of trees with a given size of matching
• The spectral radius of trees on \(k\) pendant vertices
• On the index of bicyclic graphs with perfect matchings
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices

This page was built for publication: SPECTRAL RADII OF UNICYCLIC GRAPHS WITH FIXED NUMBER OF CUT VERTICES