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
Covering radius, codimension, and dual-distance width
Patrick Solé,P. Stokes +1 more
TL;DR: Upper bounds on the covering radius of codes with a given cardinality and a given dual-distance width are derived and results improve asymptotically on the upper bounds published by A. Tietavainen (1990) relating the coveringradius with the dual distance.
Proceedings ArticleDOI
On the automorphism groups of strongly regular graphs I
TL;DR: It is proved that no polynomial-time categorical reduction of GI to isomorphism of s.r. graphs is possible, giving a surprisingly strong answer to a decades-old problem, and state a purely mathematical conjecture that could bring us closer to finding the right kind of hierarchy.
Journal ArticleDOI
Enumerating big orbits and an application: B acting on the cosets of Fi23
TL;DR: In this paper, the multiplicity-free action of the sporadic simple Baby Monster group on the cosets of its maximal subgroup Fi23 is applied to determine the character table of the associated endomorphism ring.
Journal ArticleDOI
A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
Mikhail Klin,Christian Pech +1 more
TL;DR: New constructions of regular distance regular antipodal covers (in the sense of Godsil-Hensel) of complete graphs K n are presented and a new regular cover of K 45 on 135 vertices is produced with the aid of a decoration of the alternating group A 6.
Journal ArticleDOI
Rigidity of the Bonnet-Myers inequality for graphs with respect to Ollivier Ricci curvature.
TL;DR: In this paper, the authors introduced the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature sense, and classified all self-centered BonnetMyers sharp graphs under the additional condition θ 1 = b 1 − 1.
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.