Distance spectral radius of trees with given number of segments
From MaRDI portal
Publication:2180090
DOI10.1016/j.laa.2020.04.010zbMath1439.05141OpenAlexW3016902131MaRDI QIDQ2180090
Publication date: 13 May 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.04.010
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)
Related Items (2)
On the largest and least eigenvalues of eccentricity matrix of trees ⋮ Maximal distance spectral radius of 4-chromatic planar graphs
Cites Work
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- On distance spectral radius of graphs
- The effect of a graft transformation on distance spectral radius
- Distance spectra of graphs: a survey
- Cospectrality of graphs with respect to distance matrices
- Distance spectral radius of complete multipartite graphs and majorization
- Convex and quasiconvex functions on trees and their applications
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- The distance spectral radius of graphs with given number of odd vertices
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- Distance spectral radius of trees with fixed maximum degree
- The distance spectral radius of trees
- On the Addressing Problem for Loop Switching
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distance spectral radius of trees with given number of segments