On the distance spectral radius of some graphs

DOI10.1016/j.laa.2012.04.036zbMath1247.05146OpenAlexW2081783657MaRDI QIDQ445856

Xiao-Ling Zhang

Publication date: 27 August 2012

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

Full work available at URL: https://doi.org/10.1016/j.laa.2012.04.036

zbMATH Keywords

diameterdistance matrixdistance spectral radiuslinear hexagonal chain

Mathematics Subject Classification ID

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

Related Items

Connectivity, diameter, independence number and the distance spectral radius of graphs, On the distance spectrum of graphs, Remoteness and distance eigenvalues of a graph, The distance eigenvalues of the complements of unicyclic graphs, Complete multipartite graphs are determined by their distance spectra, The distance energy of clique trees, Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs, Distance spectra of graphs: a survey, On graphs with at least three distance eigenvalues less than \(-1\), Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles, The distance spectrum of complements of trees, On the distance and distance Laplacian eigenvalues of graphs, On the distance spectral radius of digraphs with given diameter

Cites Work

• Distance spectral radius of trees with given matching number
• Distance spectral radius of graphs with \(r\) pendent vertices
• Some graft transformations and its application on a distance spectrum
• On the distance spectral radius of bipartite graphs
• Connectivity and minimal distance spectral radius of graphs
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Distance spectral radius of trees with fixed maximum degree