Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Adjacency matrixBipartite halfConnectivity (graph theory)Distance (graph theory)

Broader (1)

Algebraic graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Discriminating Power of Centrality Measures
The calculation of centrality measures is common practice in the study of networks, as they attempt to quantify the importance of… 
2010
2010
Distance-regular graph with large a1 or c2
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
2007
Corrections and additions to the book ‘ Distance-regular Graphs ’
  • 2007
  • Corpus ID: 17922882
This note contains corrections for all errors in [BCN] known to us. Moreover, it provides some additional material and references… 
2004
2004
Some Notes on Distance-Transitive and Distance-Regular Graphs
These are notes from lectures given in the Queen Mary Combinatorics Study 1 Introductory Definitions In these notes, Γ = (V Γ, E… 
2004
2004
Bipartite Q-Polynomial Distance-Regular Graphs
Abstract.Let Γ denote a bipartite distance-regular graph with diameter D≥12. We show Γ is Q-polynomial if and only if one of the… 
2003
2003
A Distance-Regular Graph with Intersection Array
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… 
1995
1995
A remark on bipartite distance-regular graphs of even valency
LetГ be a bipartite distance-regular graph of even valencyk. Let us consider the intersection array modulo 2, which would become… 
1992
1992
On Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d ≤ (s − 1)(k − 1) + 1 for distance-regular graphs with girth 2s and valency k. We… 
1990
1990
On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs
Abst rac t In [5] we established some relations between Distance Regular Graphs and Completely-Regular Codes in order to show the… 
1989
1989
Distance-regular graphs and eigenvalue multiplicities
This thesis will focus on the consequences of a distance-regular graph possessing an eigenvalue of low multiplicity. We obtain…