Sharp bounds on distance spectral radius of graphs

DOI10.1080/03081087.2012.707395 10.1080/03081087.2012.689984; 10.1080/03081087.2012.707395zbMath1273.05135OpenAlexW4239938636MaRDI QIDQ5300034

Huiqiu Lin, Jin-Long Shu

Publication date: 24 June 2013

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2012.707395

zbMATH Keywords

sharp lower boundsdistance spectral radiussharp upper boundsaverage distance degreepseudo distance regular

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

Proximity, remoteness and distance eigenvalues of a graph, On the least distance eigenvalue and its applications on the distance spread, Distance signless Laplacian spectrum of a graph, Sharp upper bounds on the distance spectral radius of a graph, The distance energy of clique trees, On distance Laplacian and distance signless Laplacian eigenvalues of graphs

Cites Work

• Distance spectral radius of trees with given matching number
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• The distance spectrum of a tree
• Unnamed Item