The distance spectral radius of graphs with given number of odd vertices

DOI10.13001/1081-3810.2877zbMath1339.05237OpenAlexW2347020202WikidataQ114057731 ScholiaQ114057731MaRDI QIDQ2813058

Hongying Lin, Bo Zhou

Publication date: 14 June 2016

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13001/1081-3810.2877

zbMATH Keywords

distance matrixmaximum degreedistance spectral radiusdistance Perron vectorodd vertex

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Related Items (5)

Distance spectral radius of trees with given number of segments ⋮ On distance spectral radius of graphs with given number of pendant paths of fixed length ⋮ The distance spectral radius of trees ⋮ On the distance spectral radius of trees with given degree sequence ⋮ On the distance \(\alpha \)-spectral radius of a connected graph

Cites Work

• Unnamed Item
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• Spanning spiders and light-splitting switches
• On distance spectral radius of graphs
• The effect of a graft transformation on distance spectral radius
• Distance spectra of graphs: a survey
• On the distance spectral radius of trees
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• On the Addressing Problem for Loop Switching

This page was built for publication: The distance spectral radius of graphs with given number of odd vertices