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
A Classification of Flag-transitive Classical c.C2-geometries by Means of Generators and Relations
TL;DR: A readable and uniform proof of the classification of the flag-transitive classical c.C2-geometries with s ?
Journal Article
Extended near hexagons and line systems
TL;DR: In this article, extended near hexagons are studied and a class of line systems in which two lines are either perpendicular, or make an angle a with cos a ¼ G1=3.
Journal ArticleDOI
Linear Programming Bounds for Regular Graphs
TL;DR: It is proved that a connected k-regular graph satisfying g>2d-1 has the minimum second-largest eigenvalue of all k- regular graphs of the same size, where d is the number of distinct non-trivial eigenvalues, and g is the girth.
Posted Content
Coherent configurations and triply regular association schemes obtained from spherical designs
TL;DR: In this paper, it was shown that a union of spherical designs with a certain property carries the structure of a coherent configuration, and triple regularity of tight spherical designs was derived for mutually unbiased bases, linked symmetric designs with certain parameters.
Journal ArticleDOI
On the metric dimension of the folded n -cube
TL;DR: By constructing explicitly minimal resolving sets for the folded n-cube, upper bounds on the metric dimension of this graph are obtained.
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.