𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest Paths in Distance-regular Graphs

✍ Scribed by Enrique Bendito; Angeles Carmona; Andrés M. Encinas

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
150 KB
Volume
21
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest paths in fuzzy weighted graphs
Shortest paths in fuzzy weighted graphs
✍ Chris Cornelis; Peter De Kesel; Etienne E. Kerre 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB

The task of finding shortest paths in weighted graphs is one of the archetypical problems encountered in the domain of combinatorial optimization and has been studied intensively over the past five decades. More recently, fuzzy weighted graphs, along with generalizations of algorithms for finding op

Resistance distance in regular graphs
Resistance distance in regular graphs
✍ I. Lukovits; S. Nikolić; N. Trinajstić 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 2 views

This report considers the resistance distance as a recently proposed new ## Ž . intrinsic metric on molecular graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been vertices and K denotes a complete graph contai

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