Distance spectral radius of a tree with given diameter
From MaRDI portal
Abstract: For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the trees with the minimal distance spectral radius are completely characterized.
Recommendations
- The distance spectral radius of trees
- Distance spectral radius of trees with given number of segments
- Distance spectral radius of trees with given matching number
- The distance spectrum of a tree
- Distance spectral radius of trees with fixed maximum degree
- On the distance spectral radius of trees
- Maximal distance spectral radius of trees
- scientific article; zbMATH DE number 6837018
- The Laplacian spectral radius of tree with fixed diameter
- A note on distance spectral radius of trees
Cited in
(11)- Distance spectral radius of trees with given number of segments
- On the distance spectral radius of trees with given degree sequence
- The distance spectral radius of graphs with given number of odd vertices
- Further results on the distance spectral radius of graphs
- Spectral radius of graph with given diameter.
- On the distance spectral radius of tree-like polyphenyl systems.
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- On the distance spectral radius of some graphs
- scientific article; zbMATH DE number 7668287 (Why is no real title available?)
- Minimizing the distance spectral radius of uniform hypertrees with given parameters
- Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
This page was built for publication: Distance spectral radius of a tree with given diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134366)
