✦ LIBER ✦

On the multiplicity of eigenvalues of distance-regular graphs

✍ Scribed by C.D. Godsil; J.H. Koolen

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 178 KB
Volume: 226-228
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(95)00152-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance-Regular Graphs with an Eigenval

Distance-Regular Graphs with an Eigenvalue of Multiplicity Four

✍ R.R. Zhu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 939 KB

Let \(G\) be a distance-regular graph. If \(G\) has an eigenvalue \(\theta\) of multiplicity \(m\) \((\geqslant 2)\), then \(G\) has a natural representation in \(R^{m}\). By studying the geometric properties of the image configuration in \(R^{m}\), we can obtain considerable information about the g

Bipartite Distance-Regular Graphs with a

Bipartite Distance-Regular Graphs with an Eigenvalue of Multiplicity itk m

✍ Norio Yamazaki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 194 KB

We show that, if a bipartite distance-regular graph of valency k has an eigenvalue of multiplicity k, then it becomes 2-homogeneous. Combined with a result on bipartite 2-homogeneous distance-regular graphs by K. Nomura, we have a classification of such graphs.

Distance-regular Graphs the Distance Mat

Distance-regular Graphs the Distance Matrix of which has Only One Positive Eigenvalue

✍ J.H. Koolen; S.V. Shpectorov 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 244 KB

On the Multiplicities of the Primitive I

On the Multiplicities of the Primitive Idempotents of a Q-Polynomial Distance-regular Graph

✍ Arlene A Pascasio 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 154 KB

and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let denote a distance-regular graph with diameter D ≥ 3. Suppose is Q-polynomial with respect to the ordering E 0 , E 1 , . . . , E D of

Distance regular graphs of diameter 3 an

Distance regular graphs of diameter 3 and strongly regular graphs

✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

Tails of Bipartite Distance-regular Grap

Tails of Bipartite Distance-regular Graphs

✍ Michael S. Lang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let denote a bipartite distance-regular graph with diameter D ≥ 4 and valency k ≥ 3. Let θ 0 > θ 1 > • • • > θ D denote the eigenvalues of and let E 0 , E 1 , . . . , E D denote the associated primitive idempotents. Fix s (1 ≤ s ≤ D -1) and abbreviate E := E s . We say E is a tail whenever the entry