Open AccessBook
Distance-Regular Graphs
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
A new upper bound for constant distance codes of generators on hermitian polar spaces of type H(2d − 1, q2)
TL;DR: New bounds for the maximum size of a set of generators of H(2d − 1, q2) which pairwise intersect in codimension i are provided by applying a multiplicity bound by C. D. Godsil.
Journal ArticleDOI
Taut distance-regular graphs of even diameter
TL;DR: It is shown that for D even, Γ is taut or 2-homogeneous if and only if the intersection numbers of Γ are given by certain rational expressions involving D/2 independent variables.
Journal ArticleDOI
Wreath product of a complete graph with a cyclic graph: Topological indices and spectrum
TL;DR: This manuscript considers the compound graph of a clique with a circuit to show nice combinatorial and algebraic properties which permit with reasonable effort to compute some topological indices and the (adjacency) spectrum.
Journal ArticleDOI
Finite primitive groups of small rank: symmetric and sporadic groups
Mikhail Muzychuk,Pablo Spiga +1 more
TL;DR: In this article, the authors classify finite primitive groups of small rank, where the word "small" is not an absolute constant, and they have various motivations for embarking in this classification, ranging from representation theory to combinatorics.
Journal ArticleDOI
Squares of Random Linear Codes
TL;DR: A positive answer is given, for codes of dimension k and length roughly (1/2)k2 or smaller, that the square of a code typically fill the whole space.
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.