Ordering trees by their distance spectral radii
From MaRDI portal
Publication:260039
DOI10.1016/j.dam.2015.09.009zbMath1332.05035OpenAlexW1749144997MaRDI QIDQ260039
Chi Ma, Jiwen Chen, Yuan Zhang, Wenshui Lin, Qi'an Chen, Jun-Jie Chen
Publication date: 18 March 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.009
Related Items (2)
Inertia and distance energy of line graphs of unicyclic graphs ⋮ On the distance spectral radius of trees with given degree sequence
Cites Work
- Unnamed Item
- Some graft transformations and its applications on the distance spectral radius of a graph
- On the distance spectral radius of cacti
- Extremal unicyclic graphs with minimal distance spectral radius
- 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 matrix of a tree
- Distance matrix polynomials of trees
- On distance spectral radius of graphs
- Distance spectra of graphs: a survey
- Corrigendum to: ``The distance spectral radius of digraphs
- On the least distance eigenvalue and its applications on the distance spread
- On the distance spectral radius of trees
- Further results on the distance spectral radius of graphs
- Connectivity and minimal distance spectral radius of graphs
- Distance spectral radius of trees with fixed maximum degree
- ON THE MINIMAL DISTANCE SPECTRAL RADIUS IN THE CLASS OF BICYCLIC GRAPHS
- On the Addressing Problem for Loop Switching
- Ordering trees by their largest eigenvalues
This page was built for publication: Ordering trees by their distance spectral radii
