✦ LIBER ✦

Retracing Argument for Distance-Regular Graphs

✍ Scribed by Akira Hiraki

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 220 KB
Volume: 79
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1961

No coin nor oath required. For personal study only.

✦ Synopsis

We introduce the retracing argument for distance-regular graphs and prove several results by applying this argument.

📜 SIMILAR VOLUMES

From regular boundary graphs to antipoda

From regular boundary graphs to antipodal distance-regular graphs

✍ Fiol, M. A.; Garriga, E.; Yebra, J. L. A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

Let Γ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (λ) > n -1, then D ≤ d -1, where P is the polynomial of degree d-1 which takes alternating values ±1 at λ 1 , . . . , λ d . The graphs satisfying P (λ) = n -1, called boundary graphs, h

Some Elementary Inequalities For Distanc

Some Elementary Inequalities For Distance-regular Graphs

✍ Ernst Lambeck 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 21 KB

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, III

✍ Akira Hiraki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Let ⌫ be a distance-regular graph with l (1 , a 1 , b 1 ) ϭ 1 and c s ϩ 1 ϭ 1 for some positive integer s . We show the existence of a certain distance-regular graph of diameter s , containing given two vertices at distance s , as a subgraph in ⌫ .

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, IV

✍ Akira Hiraki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Let ⌫ be a distance-regular graph with a 1 Ͼ 0 , r ϭ max ͕ j 3 ( c j , a j , b j ) ϭ ( c 1 , a 1 , b 1 ) ͖ у 2 and a i ϭ a 1 c i , for 1 р i р 2 r . Take any u and in ⌫ at distance r ϩ 1 . We show that there exists a collinearity graph of a generalized 2( r ϩ 1)-gon of order ( a 1 ϩ 1 , c r ϩ 1 Ϫ 1)

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, V

✍ A. Hiraki 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, VI

✍ A. Hiraki 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 202 KB

In this paper we give a sufficient condition for the existence of a strongly closed subgraph which is (c q + a q )-regular of diameter q containing a given pair of vertices at distance q in a distance-regular graph. Moreover we show that a distance-regular graph with r = max{ j | (c j , a j , b j )