Distance-regular graphs with a relatively small eigenvalue multiplicity

MaRDI QIDQ1953371zbMATH OpenFDO

Authors Jack H. Koolen, Joohyung Kim, Jongyook Park

Publication date 7 June 2013

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

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p1

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

zbMATH Keywords

distance-regular graphslight tailsmall multiplicityTaylor graphstight distance-regular graphs

Mathematics Subject Classification ID

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

Review text

Summary: \textit{C. D. Godsil} [Combinatorica 8, No. 4, 333--343 (1988; Zbl 0657.05047)] showed that if \(\Gamma\) is a distance-regular graph with diameter \(D \geq 3\) and valency \(k \geq 3\), and \(\theta\) is an eigenvalue of \(\Gamma\) with multiplicity \(m \geq 2\), then \(k \leq\frac{(m+2)(m-1)}{2}\). In this paper we will give a refined statement of this result. We show that if \(\Gamma\) is a distance-regular graph with diameter \(D \geq 3\), valency \(k \geq 2\) and an eigenvalue \(\theta\) with multiplicity \(m\geq 2\), such that \(k\) is close to \(\frac{(m+2)(m-1)}{2}\), then \(\theta\) must be a tail. We also characterize the distance-regular graphs with diameter \(D \geq 3\), valency \(k \geq 3\) and an eigenvalue \(\theta\) with multiplicity \(m \geq 2\) satisfying \(k= \frac{(m+2)(m-1)}{2}\).

Recommendations

• Bounding the diameter of distance. Regular graphs
• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
• On the multiplicity of eigenvalues of distance-regular graphs
• Distance-regular graphs with an eigenvalue of multiplicity four
• A new feasibility condition for distance-regular graphs

Cited in

(16)

• A new feasibility condition for distance-regular graphs
• Bounding the diameter of distance. Regular graphs
• Distance-regular graphs with an eigenvalue of multiplicity four
• An inequality involving the local eigenvalues of a distance-regular graph
• An improvement of the Godsil bound
• On the multiplicity of eigenvalues of distance-regular graphs
• Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\)
• Distance-regular graphs with small number of distinct distance eigenvalues
• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
• Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
• Twice Q-polynomial distance-regular graphs of diameter 4
• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
• scientific article; zbMATH DE number 6107248 (Why is no real title available?)
• Distance-regular Cayley graphs with small valency
• Distance-regular graphs with or at least half the valency
• Some results on the eigenvalues of distance-regular graphs

This page was built for publication: Distance-regular graphs with a relatively small eigenvalue multiplicity

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