Spectral diameter estimates for k-regular graphs

DOI10.1006/AIMA.1994.1052MaRDI QIDQ1333236zbMATH OpenOpenAlexFDO

Authors Gregory T. Quenell

Publication date 1994

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/aima.1994.1052

zbMATH Keywords

adjacency matrixdiametereigenvaluegirthregular graphupper bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

An upper bound for the diameter of a regular graph, which depends on the second largest eigenvalue (in modulus) of the adjacency matrix and on the girth, is derived.

Cited in

(8)

• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• On generalized \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
• Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs
• Some properties of graphs determined by edge zeta functions

This page was built for publication: Spectral diameter estimates for \(k\)-regular graphs

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