Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
type: Item
instance of: scholarly article
title: Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
zbMATH Open document ID: 0933.05080
DOI: 10.1016/S0012-365X(98)00206-4
published in: Discrete Mathematics
publication date: 1999-08-09T00:00:00Z
review text: The paper compares some recent bounds on the diameter and mean distance of graphs in terms of the eigenvalues of either the adjacency matrix or the Laplacian matrix of the graph.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 1321781
zbMATH Keywords: diameter
zbMATH Keywords: mean distance
zbMATH Keywords: eigenvalues
zbMATH Keywords: adjacency matrix
zbMATH Keywords: Laplacian matrix
author: Juan A. Rodríguez-Velázquez
author: J. Luis A. Yebra
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
cites work: Diameters and Eigenvalues
cites work: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
cites work: Diameter, covering index, covering radius and eigenvalues
cites work: On a class of polynomials and its relation with the spectra and diameters of graphs
cites work: From regular boundary graphs to antipodal distance-regular graphs
cites work: Boundary graphs: The limit case of a spectral property
cites work: Boundary graphs. II: The limit case of a spectral property
cites work: The alternating polynomials and their relation with the spectra and conditional diameters of graphs
cites work: Q4873761
cites work: Eigenvalues, diameter, and mean distance in graphs
cites work: Spectral diameter estimates for \(k\)-regular graphs
cites work: Q3999365
cites work: Eigenvalues and the diameter of graphs
Recommended article: Eigenvalues, diameter, and mean distance in graphs
Recommended article: On the distance and distance Laplacian eigenvalues of graphs
Recommended article: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
Recommended article: On the Sum of Distance Laplacian Eigenvalues of Graphs
Recommended article: Eigenvalues and the diameter of graphs
Recommended article: On the normalized distance Laplacian eigenvalues of graphs
Recommended article: An eigenvalue bound for the Laplacian of a graph
Recommended article: The diameter and Laplacian eigenvalues of directed graphs
Recommended article: Bounds for Laplacian graph eigenvalues
Recommended article: Bounding the gap between extremal Laplacian eigenvalues of graphs
description: scientific article; zbMATH DE number 1321781