Spectral diameter estimates for \(k\)-regular graphs
From MaRDI portal
Publication:1333236
DOI10.1006/aima.1994.1052zbMath0808.05071OpenAlexW2049518778MaRDI QIDQ1333236
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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ The alternating polynomials and their relation with the spectra and conditional diameters of graphs ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ Some properties of graphs determined by edge zeta functions ⋮ Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs ⋮ 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
This page was built for publication: Spectral diameter estimates for \(k\)-regular graphs
