Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods

DOI10.1016/S0012-365X(98)00206-4zbMATH Open0933.05080MaRDI QIDQ1297416FDOQ1297416

Authors: Juan A. Rodríguez-Velázquez, J. Luis A. Yebra 

Publication date: 9 August 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Eigenvalues, diameter, and mean distance in graphs
• On the distance and distance Laplacian eigenvalues of graphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• On the Sum of Distance Laplacian Eigenvalues of Graphs
• Eigenvalues and the diameter of graphs
• On the normalized distance Laplacian eigenvalues of graphs
• An eigenvalue bound for the Laplacian of a graph
• The diameter and Laplacian eigenvalues of directed graphs
• Bounds for Laplacian graph eigenvalues
• Bounding the gap between extremal Laplacian eigenvalues of graphs

zbMATH Keywords

eigenvaluesLaplacian matrixadjacency matrixdiametermean distance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• From regular boundary graphs to antipodal distance-regular graphs
• Title not available (Why is that?)
• Diameters and Eigenvalues
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Eigenvalues, diameter, and mean distance in graphs
• Title not available (Why is that?)
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• 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
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• Diameter, covering index, covering radius and eigenvalues
• Eigenvalues and the diameter of graphs
• Spectral diameter estimates for \(k\)-regular graphs

Cited In (6)

• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
• Continuous mean distance of a weighted graph
• On mean distance and girth
• The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter
• A note on a distance bound using eigenvalues of the normalized Laplacian matrix
• Eigenvalues, diameter, and mean distance in 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297416)