𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance regularity of compositions of graphs

✍ Scribed by D Stevanović

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
483 KB
Volume
17
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. (~) 2004 Elsevier Ltd. All rights reserved.

📜 SIMILAR VOLUMES

The distance spectrum and energy of the
The distance spectrum and energy of the compositions of regular graphs
✍ Dragan Stevanović; Gopalapillai Indulal 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 365 KB

The distance energy of a graph G is a recently developed energy-type invariant, defined as the absolute deviation of the eigenvalues of the distance matrix of G. It is a useful molecular descriptor in QSPR modelling, as demonstrated by Consonni and Todeschini in [V. Consonni, R. Todeschini, New spec

Distance regular graphs of diameter 3 an
Distance regular graphs of diameter 3 and strongly regular graphs
✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

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)