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 pseudocyclic table algebras and applications to pseudocyclic association schemes
Bangteng Xu,Harvey I. Blau +1 more
TL;DR: In this article, the authors prove some general properties of pseudocyclic table algebras via the study of pseudo-cycle association schemes, such as subschemes and quotient schemes.
Journal ArticleDOI
Star complements and exceptional graphs
TL;DR: In this article, the authors established properties of star complements, and of eigenvectors, of exceptional graphs with least eigenvalue −2, other than a generalized line graph, whose eigenvalues lie in [−2, ∞.
Journal ArticleDOI
A generalization of an inequality of Brouwer-Wilbrink
Akira Hiraki,Jack H. Koolen +1 more
TL;DR: This note generalizes Brouwer and Wilbrink's inequality to all diameter to hold for a regular near 2d-gon of order with s ≥ 2 and where the diameter d is even.
Journal ArticleDOI
Geometric aspects of 2-walk-regular graphs
TL;DR: In this article, a 2-walk-regular graph is defined as a graph for which the number of walks of given length between two vertices depends only on the distance between them, as long as this distance is at most t.
Journal ArticleDOI
Distance Regular Covers of Complete Graphs from Latin Squares
D. de Caen,D. Fon-Der-Flaass +1 more
TL;DR: A new construction of distance regular covers of a complete graph Kq2t with fibres of size q2t-1, q a power of 2, which uses, as one ingredient, an arbitrary symmetric Latin square of order q; so, for large q, it can produce many different covers.
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.