Open AccessBook
Distance-Regular Graphs
Reads0
Chats0
TLDR
In this paper, a connected simple graph with vertex set X of diameter d is considered, and the authors define Ri X2 by (x, y) Ri whenever x and y have graph distance.Abstract:
Consider a connected simple graph with vertex set X of diameter d. Define Ri X2 by (x, y) Ri whenever x and y have graph distanceread more
Citations
More filters
Journal ArticleDOI
On mixed Moore graphs
TL;DR: All known mixed Moore graphs of diameter k=2 are unique and that mixed Moore graph ofiameter k>=3 do not exist, which is to show that undirected Moore graphs only exist in a small number of cases.
Posted Content
Distance-regular graphs
TL;DR: An introduction to distance-regular graphs is presented for the reader who is unfamiliar with the subject, and an overview of some developments in the area of distance- regular graphs since the monograph 'BCN' was written.
Journal ArticleDOI
Theorems of Erdős-Ko-Rado type in polar spaces
TL;DR: The Erdos-Ko-Rado sets of generators of maximum size in all polar spaces, except for H(4n+1,q^2) with n>=2, are characterized.
Journal ArticleDOI
Spectral Characterizations of Some Distance-Regular Graphs
Edwin van Dam,Willem H. Haemers +1 more
TL;DR: In this paper, it was shown that the following distance-regular graphs are uniquely determined by their spectrum: the collinearity graphs of the generalized octagons of order (2, 1), (3, 1) and (4, 1).
Journal ArticleDOI
Imprimitive cometric association schemes: Constructions and analysis
TL;DR: In this paper, a new family of cometric polynomial association schemes with four associate classes based on linked systems of symmetric designs is presented, and the analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which are answered with others left as open problems.
References
More filters
Journal ArticleDOI
Equilateral point sets in elliptic geometry
J.H. van Lint,J.J. Seidel +1 more
TL;DR: In this paper, the authors highlight equilateral point sets in elliptic geometry and show that Paley's construction may be reversed to obtain a C -matrix of order 46, in view of the existence of a Hadamard matrix of order 92.
BookDOI
On construction and identification of graphs
TL;DR: The problem of graph identification has been studied in the theory of permutation groups for a long time, see as mentioned in this paper for a discussion of the main points of the problem and an algorithm for graph identification.