✦ LIBER ✦

The Girth of a Directed Distance-Regular Graph

✍ Scribed by D.A. Leonard; K. Nomura

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 149 KB
Volume: 58
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1028

No coin nor oath required. For personal study only.

📜 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 )

On the distance matrix of a directed gra

On the distance matrix of a directed graph

✍ R. L. Graham; A. J. Hoffman; H. Hosoya 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _

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