𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The classification of distance-regular graphs of type IIB

✍ Scribed by P. Terwilliger

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
313 KB
Volume
8
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Classical Distance-Regular Graphs of Neg
Classical Distance-Regular Graphs of Negative Type
✍ Chih-wen Weng πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 160 KB

We prove the following theorem. Theorem. Let 1=(X, R) denote a distance-regular graph with classical parameters (d, b, :, ;) and d 4. Suppose b<&1, and suppose the intersection numbers a 1 {0, c 2 >1. Then precisely one of the following (i) (iii) holds. (i) 1 is the dual polar graph 2 A 2d&1 (&b).

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

The Terwilliger algebra of a distance-re
The Terwilliger algebra of a distance-regular graph of negative type
✍ Ε tefko Miklavič πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 258 KB

Let denote a distance-regular graph with diameter D 3. Assume has classical parameters (D, b, α, β) with b < -1. Let X denote the vertex set of and let A ∈ Mat X (C) denote the adjacency matrix of . Fix x ∈ X and let A \* ∈ Mat X (C) denote the corresponding dual adjacency matrix. Let T denote the s