Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
From MaRDI portal
Publication:824501
DOI10.1186/s13660-018-1663-5zbMath1497.05148OpenAlexW2807590508WikidataQ55139902 ScholiaQ55139902MaRDI QIDQ824501
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1663-5
Graph polynomials (05C31) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Proximity, remoteness and distance eigenvalues of a graph
- Remoteness and distance eigenvalues of a graph
- Two Laplacians for the distance matrix of a graph
- Graph functions maximized on a path
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- The difference between remoteness and radius of a graph
- On the least distance eigenvalue and its applications on the distance spread
- Proof of conjectures on remoteness and proximity in graphs
- On the distance spectrum of graphs
- On the distance signless Laplacian of a graph
- On the distance signless Laplacian spectral radius of graphs
- On the second largest distance eigenvalue of a graph
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- Graphs with small diameter determined by their $D$-spectra
- Remoteness, proximity and few other distance invariants in graphs
- On the distance spectrum of trees
- On the distance and distance Laplacian eigenvalues of graphs
This page was built for publication: Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
