✦ LIBER ✦

Dual Bipartite Q-polynomial Distance-regular Graphs

✍ Scribed by Garth A. Dickie; Paul M. Terwilliger

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 269 KB
Volume: 17
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite Q-Polynomial Quotients of Anti

Bipartite Q-Polynomial Quotients of Antipodal Distance-Regular Graphs

✍ John S. Caughman IV 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Let 1 denote a bipartite Q-polynomial distance-regular graph with diameter D 4. We show that 1 is the quotient of an antipodal distance-regular graph if and only if one of the following holds. (i) 1 is a cycle of even length. (ii) 1 is the quotient of the 2D-cube. 1999 Academic Press \* , ..., %\

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

Almost 2-homogeneous Bipartite Distance-

Almost 2-homogeneous Bipartite Distance-regular Graphs

✍ Brian Curtin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Spin Models on Bipartite Distance-Regula

Spin Models on Bipartite Distance-Regular Graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 430 KB

Spin models were introduced by V. Jones (Pac. J. Math. 137 (1989), 311-336) to construct invariants of knots and links. A spin model will be defined as a pair \(S=(X, w)\) of a finite set \(X\) and a function \(w\) on \(X \times X\) satisfying several axioms. Some important spin models can be constr

The Local Structure of a Bipartite Dista

The Local Structure of a Bipartite Distance-regular Graph

✍ Brian Curtin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 285 KB

In this paper, we consider a bipartite distance-regular graph = (X, E) with diameter d ≥ 3. We investigate the local structure of , focusing on those vertices with distance at most 2 from a given vertex x. To do this, we consider a subalgebra R = R(x) of Mat X (C), where X denotes the set of vertice

Distance-regular Graphs withbi=cd−iand T

Distance-regular Graphs withbi=cd−iand Two P-polynomial Structures

✍ Tomoya Koishi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Let be a distance-regular graph with b i = c d-i for all 1 ≤ i ≤ r. We show that if the diameter d ≤ 3r + 2 and a d = 0, then k d = a d + 1 and has two P-polynomial structures.