Ordering graphs with cut edges by their spectral radii

DOI10.1007/S10255-012-0134-XzbMath1355.05155OpenAlexW2145598356MaRDI QIDQ511097

Kun-fu Fang

Publication date: 14 February 2017

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-012-0134-x

zbMATH Keywords

orderingeigenvaluespectral radiuscut edge

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Ordering graphs by their largest (least) A_α-eigenvalues

Cites Work

• The spectral radius of trees on \(k\) pendant vertices
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordering graphs with cut edges by their spectral radii