Some Spectral Characterizations of Strongly Distance-Regular Graphs
From MaRDI portal
Publication:2726709
DOI10.1017/S0963548301004564zbMath0973.05064MaRDI QIDQ2726709
No author found.
Publication date: 28 November 2001
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75)
Related Items
On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ On the spectrum of an extremal graph with four eigenvalues ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular ⋮ Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs
