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
Proceedings ArticleDOI
Codes for network coding
E.M. Gabidulin,Martin Bossert +1 more
TL;DR: Several classes of codes are defined and investigated in a metric for error correction in network coding, and constant-dimension codes were introduced and investigated.
Journal ArticleDOI
Small regular graphs with four eigenvalues
Edwin van Dam,Edward Spence +1 more
TL;DR: For most feasible spectra of connected regular graphs with four distinct eigenvalues and at most 30 vertices the authors find all such graphs, using both theoretic and computer results.
Book ChapterDOI
The Incidence Algebra of a Uniform Poset
TL;DR: In this paper, a finite graded poset of rank N ≥ 2, with fibers P 0, P 1, P 2, P 3, P 4, P 5, P 6, P 7, P 8, P 9, P 10, P 11, P 12, P 13, P 14, P 15, P 16, P 17, P 18, P 19, P 20, P 21, P 22, P 23, P 24, P 25, P 26, P 27, P 28, P 29, P 30, P 31, P 34
Journal ArticleDOI
Bipartite Distance-regular Graphs, Part II
TL;DR: The study of the Terwilliger algebra T of a bipartite distance-regular graph is continued and the thin irreducible T-modules of endpoint 2 are focused on.
Journal ArticleDOI
The Subconstituent Algebra of a Strongly Regular Graph
Masato Tomiyama,Norio Yamazaki +1 more
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.