Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
From MaRDI portal
Publication:1297416
DOI10.1016/S0012-365X(98)00206-4zbMath0933.05080MaRDI QIDQ1297416
J. Luis A. Yebra, Juan Alberto Rodríguez-Velázquez
Publication date: 9 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (4)
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ On mean distance and girth ⋮ Continuous mean distance of a weighted graph ⋮ The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter
Cites Work
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Diameter, covering index, covering radius and eigenvalues
- Eigenvalues, diameter, and mean distance in graphs
- Spectral diameter estimates for \(k\)-regular graphs
- The alternating polynomials and their relation with the spectra and conditional diameters of graphs
- Boundary graphs. II: The limit case of a spectral property
- Boundary graphs: The limit case of a spectral property
- On a class of polynomials and its relation with the spectra and diameters of graphs
- Diameters and Eigenvalues
- From regular boundary graphs to antipodal distance-regular graphs
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- Eigenvalues and the diameter of graphs
This page was built for publication: Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
