On the spectrum, the growth, and the diameter of a graph

DOI10.1006/jctb.1998.1882zbMath0930.05066OpenAlexW2067205385MaRDI QIDQ1305521

N. Hajaj

Publication date: 9 February 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4aabbd6656ca34bb8c3285550213c371af104086

zbMATH Keywords

eigenvaluesspectrumdiameterLaplaciandistance-regularharmonic mean of the growth

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

Diameters of uniform subset graphs ⋮ A continuous analogue of the girth problem

Cites Work

• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Simple random walks on trees
• Ramanujan graphs
• A Survey on Spectra of infinite Graphs
• Diameters and Eigenvalues
• On the Polynomial of a Graph
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian