Distance-regular graph

Known as: Intersection Array, Array, Distance-regular graphs

In mathematics, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

The calculation of centrality measures is common practice in the study of networks, as they attempt to quantify the importance of…

2010

In this paper, we study distance-regular graphs $\Gamma$ that have a pair of distinct vertices, say x and y, such that the number…

2007

This note contains corrections for all errors in [BCN] known to us. Moreover, it provides some additional material and references…

2004

These are notes from lectures given in the Queen Mary Combinatorics Study 1 Introductory Definitions In these notes, Γ = (V Γ, E…

2003

We prove that a distance-regular graph with intersection array (5, 4, 3, 3; 1, 1, 1, 2) does not exist. The proof is purely…

1997

In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which…

1995

We describe a new distance-regular, but not distance-transitive, graph. This graph has intersection array f110; 81; 12; 1; 18…

1992

Terwilliger [15] has given the diameter bound d ≤ (s − 1)(k − 1) + 1 for distance-regular graphs with girth 2s and valency k. We…

1991

1988