Distance spectral radius of trees with fixed number of pendent vertices

DOI10.1016/j.laa.2013.06.030zbMath1282.05147OpenAlexW2116617159MaRDI QIDQ2435380

Mei Lu, Liangqi Ouyang, Wenjie Ning

Publication date: 19 February 2014

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

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

zbMATH Keywords

treedistance matrixpendent vertexdistance spectral matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

The distance spectrum of the complements of graphs of diameter greater than three ⋮ The distance spectrum of the complements of graphs with two pendent vertices ⋮ Minimizing the distance spectral radius of uniform hypertrees with given parameters ⋮ On distance spectral radius of graphs with given number of pendant paths of fixed length ⋮ Distance spectral radius of the complements of trees with fixed parameters ⋮ On the largest and least eigenvalues of eccentricity matrix of trees ⋮ The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs ⋮ Distance spectra of graphs: a survey ⋮ Distance spectral radii of k-uniform hypertrees with given parameters ⋮ On the distance spectral radius of trees with given degree sequence

Cites Work

• A note on two problems in connexion with graphs
• 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
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• On the distance spectral radius of trees
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Distance spectral radius of trees with fixed maximum degree
• New Bounds on the Complexity of the Shortest Path Problem
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item