Distance-regular graphs where the distance-d graph has fewer distinct eigenvalues

DOI10.1016/J.LAA.2015.04.020MaRDI QIDQ2348937zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 June 2015

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.0389

zbMATH Keywords

Bose-Mesner algebradistance-regular graphhalf-antipodalityKneser graph

Mathematics Subject Classification ID

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

Abstract: Let the Kneser graph $K$ of a distance-regular graph $Gamma$ be the graph on the same vertex set as $Gamma$, where two vertices are adjacent when they have maximal distance in $Gamma$. We study the situation where the Bose-Mesner algebra of $Gamma$ is not generated by the adjacency matrix of $K$. In particular, we obtain strong results in the so-called `half antipodal' case.

Recommendations

• 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
• An eigenvalue characterization of antipodal distance-regular graphs
• Distance-regular graphs with or at least half the valency
• Distance-regular graphs with small number of distinct distance eigenvalues

Cites work

• A quasi-spectral characterization of strongly distance-regular graphs
• scientific article; zbMATH DE number 5901910 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Some spectral characterizations of strongly distance-regular graphs

Cited in

(10)

• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
• Distance-regular graphs with small number of distinct distance eigenvalues
• A survey on the missing Moore graph
• The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
• Weak isometries of Hamming spaces
• 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
• Hyperplane sections of determinantal varieties over finite fields and linear codes
• Some results on the eigenvalues of distance-regular graphs

This page was built for publication: Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues

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