✦ LIBER ✦

Bounding the Diameter of a Distance Regular Graph by a Function of kd, II

✍ Scribed by H. Suzuki

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 844 KB
Volume: 169
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1994.1305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Girth of a Directed Distance-Regular

The Girth of a Directed Distance-Regular Graph

✍ D.A. Leonard; K. Nomura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 149 KB

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

The Terwilliger Algebra of a 2-Homogeneo

The Terwilliger Algebra of a 2-Homogeneous Bipartite Distance-Regular Graph

✍ Brian Curtin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Let 1 denote a 2-homogeneous bipartite distance-regular graph with diameter D 3 and valency k 3. Assume that 1 is not isomorphic to a Hamming cube. Fix a vertex x of 1, and let T=T(x) denote the Terwilliger algebra of T with respect to x. We give three sets of generators for T, two of which satisfy

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

On the Diameter of a Graph Related to p-

On the Diameter of a Graph Related to p-Regular Conjugacy Classes of Finite Groups

✍ Ziqun Lu; Jiping Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 77 KB

A lower bound on the order of regular gr

A lower bound on the order of regular graphs with given girth pair

✍ C. Balbuena; T. Jiang; Y. Lin; X. Marcote; M. Miller 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovács [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209–218]. A (δ, __g__)‐cage is a small