An eigenvalue characterization of antipodal distance-regular graphs

zbMath0885.05082MaRDI QIDQ1378523

J. Ning

Publication date: 15 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119257

Mathematics Subject Classification ID

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

Related Items (14)

Antipodal covers of distance-transitive generalized polygons ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ 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 ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ The \(k\)-independence number of \(t\)-connected graphs ⋮ Spectral bounds and distance-regularity ⋮ The geometry oft-spreads ink-walk-regular graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ On the \(k\)-independence number of graphs ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular ⋮ Eigenvalue interlacing and weight parameters of graphs

This page was built for publication: An eigenvalue characterization of antipodal distance-regular graphs