The distance spectral radius of graphs with given number of odd vertices
From MaRDI portal
Recommendations
Cites work
- Distance matrix polynomials of trees
- Distance spectra of graphs: a survey
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- On distance spectral radius of graphs
- On the Addressing Problem for Loop Switching
- On the distance matrix of a tree
- On the distance spectral radius of trees
- Spanning spiders and light-splitting switches
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The effect of a graft transformation on distance spectral radius
Cited in
(7)- On distance spectral radius of graphs
- On the distance -spectral radius of a connected graph
- Distance spectral radius of trees with given number of segments
- On the distance spectral radius of trees with given degree sequence
- On distance spectral radius of graphs with given number of pendant paths of fixed length
- The distance spectral radius of trees
- On distance matrices of wheel graphs with an odd number of vertices
This page was built for publication: The distance spectral radius of graphs with given number of odd vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2813058)