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
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
TL;DR: The technique involves semidefinite programming and exploiting the algebra structure of the optimization problem so that the question of finding a lower bound of the least distortion is reduced to an analytic question about orthogonal polynomials.
Journal ArticleDOI
A short proof of the odd-girth theorem
Edwin van Dam,Miquel Angel Fiol +1 more
TL;DR: An alternative and more direct proof which does not rely on the spectral excess theorem, but on a known characterization of distance regular graphs in terms of the predistance polynomial of degree d is presented.
DissertationDOI
Terwilliger algebras of wreath products of association schemes
TL;DR: In this paper, the Terwilliger Algebra of Km is used to build the basis of the Wreath product of one-class association schemes and the Dimension of the T -algebra of Kn1 oKn2 o · · · oKnD.
Journal ArticleDOI
New pseudo-planar binomials in characteristic two and related schemes
TL;DR: Three new classes of pseudo-planar binomials are provided and it is found that each pseudo-Planar function gives an association scheme which is defined on a Galois ring.
Posted Content
Uniqueness of the (22,891,1/4) spherical code
Henry Cohn,Abhinav Kumar +1 more
TL;DR: In this paper, the authors used techniques of Bannai and Sloane to give a new proof that there is a unique (22,891,1/4) spherical code.
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.