New bounds on the distance Laplacian and distance signless Laplacian spectral radii
From MaRDI portal
Publication:5142111
DOI10.22199/issn.0717-6279-2019-04-0056zbMath1451.05138arXiv1804.06335OpenAlexW2981478671MaRDI QIDQ5142111
Ana I. Julio, Roberto C. Díaz, Oscar Rojo
Publication date: 29 December 2020
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.06335
spectral radiusWiener indexdistance matrixdistance Laplacian matrixdistance signless Laplacian matrixvertex transmission
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
Cites Work
- Unnamed Item
- Two Laplacians for the distance matrix of a graph
- On a conjecture about the Szeged index
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- A note on distance matrices with unicyclic graph realizations
- On the Laplacian spectral radius of a graph
- A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph.
- Trees related to realizations of distance matrices
- Upper bound for the Laplacian graph eigenvalues
- A note on the metric properties of trees
- Distance spectra of graphs: a survey
- On the least distance eigenvalue of a graph
- Abschätzungen für die Eigenwerte positiver linearer Operatoren
- On the distance spectrum of graphs
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- On the distance signless Laplacian of a graph
- A sharp upper bound for the spectral radius of a nonnegative matrix and applications
- Matrix Analysis
- On spectral radius of the distance matrix
- Distance matrix of a graph and its realizability
- Some properties of the distance Laplacian eigenvalues of a graph
- Properties of the distance matrix of a tree
- A note on the tree realizability of a distance matrix
- On the Addressing Problem for Loop Switching
