✦ LIBER ✦

A Circuit Chasing Technique in a Distance-regular Graph with Triangles

✍ Scribed by Akira Hiraki

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 171 KB
Volume: 14
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1046

No coin nor oath required. For personal study only.

✦ Synopsis

We give an example of circuit chasing on a distance-regular graph which has triangles. In particular, we show that the number of columns (\left(c_{i}, a_{i}, b_{i}\right)=(2,2 a, e)) in the intersection array of a distance-regular graph is at most 1 , if all the preceding columns are ((1, a, b)).

📜 SIMILAR VOLUMES

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 )

Triangles in a complete chromatic graph

Triangles in a complete chromatic graph with three colors

✍ A.W Goodman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Let Kr~ be the complete graph on N vertices, and assume that each edge is assigned precisly one of three possible colors. An old and difficult problem is to find the minimum number of monochromatic triangles as a function of N. We are not able to solve this problem, but we can give sharp bounds for

An Application of a Construction Theory

An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph

✍ A. Hiraki 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 112 KB

## Let be a distance-regular graph with where r ≥ 2 and c r +1 > 1. We prove that r = 2 except for the case a 1 = a r +1 = 0 and c r +1 = 2 by showing the existence of strongly closed subgraphs.