On distance spectral radius of graphs with given number of pendant paths of fixed length
From MaRDI portal
Publication:2699702
Recommendations
Cites work
- Distance spectra of graphs: a survey
- Distance spectral radius of trees with fixed maximum degree
- Distance spectral radius of trees with fixed number of pendent vertices
- Further results on the distance spectral radius of graphs
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- On the Addressing Problem for Loop Switching
- On the distance spectral radius of cacti
- On the distance spectral radius of trees
- On the largest eigenvalue of the distance matrix of a tree
- Some graft transformations and its applications on the distance spectral radius of a graph
- The distance spectral radius of graphs with given number of odd vertices
- The effect of a graft transformation on distance spectral radius
Cited in
(5)
This page was built for publication: On distance spectral radius of graphs with given number of pendant paths of fixed length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2699702)