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 Primitive Cellular Algebras
TL;DR: In this paper, the exponentiation of a cellular algebra by a permutation group is studied and sufficient conditions for the resulting cellular algebra to be primitive and Schurian are given.
Posted Content
One-skeleta, Betti numbers and equivariant cohomology
Victor Guillemin,Catalin Zara +1 more
TL;DR: In this paper, it was shown that Goresky, Kottwitz and MacPherson showed that the one-skeleton of a G-manifold has the structure of a labeled graph and that the equivariant cohomology ring of such a graph is isomorphic to the cohomology ring.
Proceedings ArticleDOI
Construction and covering properties of constant-dimension codes
Maximilien Gadouleau,Zhiyuan Yan +1 more
TL;DR: In this paper, a new class of CDCs based on Gabidulin codes, referred to as augmented KK codes, whose cardinalities are greater than previously proposed CDCs are constructed.
Journal ArticleDOI
Embeddings of flag-transitive classical locally polar geometries of rank 3
TL;DR: The group-admissible embeddings of flag-transitive classical locally polar geometries of rank 3 are determined in this paper, as well as those of truncations of the related dual polar spaces.
Journal ArticleDOI
Classification of three-class association schemes using backtracking with dynamic variable ordering
Jan Degraer,Kris Coolsaet +1 more
TL;DR: Several techniques for the exhaustive computer generation of non-isomorphic association schemes with a given set of intersection numbers using a backtracking algorithm with forward checking and dynamic variable ordering are described.
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.