An eigenvalue characterization of antipodal distance-regular graphs

MaRDI QIDQ1378523zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_4/Abstracts/v4i1r30.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Review text

Summary: Let \(\Gamma\) be a regular (connected) graph with \(n\) vertices and \(d+1\) distinct eigenvalues. As a main result, it is shown that \(\Gamma\) is an \(r\)-antipodal distance-regular graph if and only if the distance graph \(\Gamma_d\) is constituted by disjoint copies of the complete graph \(K_r\), with \(r\) satisfying an expression in terms of \(n\) and the distinct eigenvalues.

Recommendations

• Distance-regular antipodal covering graphs
• scientific article; zbMATH DE number 482045
• A quasi-spectral characterization of strongly distance-regular graphs
• Geometric antipodal distance-regular graphs with a given smallest eigenvalue

Cited in

(22)

• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• Eigenvalue interlacing and weight parameters of graphs
• Antipodal covers of distance-transitive generalized polygons
• Spectral bounds and distance-regularity
• Spectral characterizations of anti-regular graphs
• A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
• The \(k\)-independence number of \(t\)-connected graphs
• On the \(k\)-independence number of graphs
• Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
• On antipodal properties for eigenfunctions of graphs
• Spectral determinations and eccentricity matrix of graphs
• On inertia and ratio type bounds for the k-independence number of a graph and their relationship
• scientific article; zbMATH DE number 5901910 (Why is no real title available?)
• The geometry of t-spreads in k-walk-regular graphs
• Eigenpolytopes of Distance Regular Graphs
• From regular boundary graphs to antipodal distance-regular graphs
• Spectral bounds for the \(k\)-independence number of a graph
• Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
• The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
• The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
• Algebraic bounds for the independence and chromatic number of graph powers
• Some results on the eigenvalues of distance-regular graphs

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

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