On distance spectral radius of graphs

DOI10.1016/j.laa.2012.12.024zbMath1261.05060MaRDI QIDQ1947109

Bo Zhou, Yanna Wang

Publication date: 12 April 2013

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.12.024

zbMATH Keywords

trees; domination number; distance matrix; distance spectral radius; bipartition size

Mathematics Subject Classification ID

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

05C12: Distance in graphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C40: Connectivity

Related Items

The distance spectral radius of trees, On distance spectral radius of hypergraphs, Laplacian and signless Laplacian spectral radii of graphs with fixed domination number, Minimizing the distance spectral radius of uniform hypertrees with given parameters, Ordering trees by their distance spectral radii, Remoteness and distance eigenvalues of a graph, Distance spectral radius of uniform hypergraphs, A note on distance spectral radius of trees, Extremal cacti of given matching number with respect to the distance spectral radius, On the distance \(\alpha \)-spectral radius of a connected graph, Distance spectral radius of trees with given number of segments, Distance eigenvalues of a cograph and their multiplicities, On the largest and least eigenvalues of eccentricity matrix of trees, The effect of a graft transformation on distance spectral radius, Distance spectra of graphs: a survey, On the distance spectral radius of trees with given degree sequence, Connectivity, diameter, independence number and the distance spectral radius of graphs, On the distance and distance signless Laplacian spectral radii of bicyclic graphs, On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs, Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond, The distance spectral radius of graphs with given number of odd vertices, Domination and Spectral Graph Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Some graft transformations and its applications on the distance spectral radius of a graph
• 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
• Domination, radius, and minimum degree
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• Average distance and domination number
• Graph-theoretic parameters concerning domination, independence, and irredundance
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• The distance spectrum of a tree
• Distance spectral radius of trees with fixed maximum degree
• On Distance Spectral Radius and Distance Energy of Graphs
• On the Addressing Problem for Loop Switching