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 graphs and codes
TL;DR: This paper shows that the binary Golay code is merely a special case of a general method of constructing codes from graphs, such as self-orthogonality, which can be obtained by putting certain conditions on the graph with which the authors start.
Journal ArticleDOI
Homogeneous factorisations of Johnson graphs
TL;DR: A classification is given of all homogeneous factorisations of finite Johnson graphs.
Journal ArticleDOI
The endomorphisms of Grassmann graphs
TL;DR: It is shown that every Grassmann graph is a pseudo-core, which means that J 2 is not a core and J q (2 k + 1, 2) (k ≥ 2) is a core.
Journal ArticleDOI
Cayley properties of the line graphs induced by consecutive layers of the hypercube
TL;DR: In this article, the authors investigated algebraic properties of the line graph of the graph and showed that it is a vertex-transitive non-Cayley graph if and only if n is a power of a prime p.
Journal ArticleDOI
Construction of association schemes from difference sets
Sejeong Bang,Mitsugu Hirasaka +1 more
TL;DR: This paper considers an analogy of the above for association schemes and construct such extensions of association schemes from a difference set when H is an elementary Abelian group.
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.