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 Computer-Assisted Proof of the Uniqueness of the Perkel Graph
Kris Coolsaet,Jan Degraer +1 more
TL;DR: A computer assisted proof that every graph Γ with this intersection array is isomorphic to the Perkel graph is described, and it is proved mathematically that there is, up to isomorphism, only a single graph Β with this property.
Journal ArticleDOI
The automorphism group of the bipartite Kneser graph
TL;DR: In this paper, the bipartite Kneser graph H(n, k) was shown to be an automorphism group of the cyclic group of order 2.
Proceedings ArticleDOI
Nonlinear projection for the display of high dimensional distance data
Daniel Ashlock,Justin Schonfeld +1 more
TL;DR: This study presents an evolutionary algorithm for producing nonlinear projections of high dimensional data with cues, in the drawing of the projection, as to the types of distortions introduced, to provide drawings closer to the true high dimensional distances of the displayed data than any single linear drawing.
Journal ArticleDOI
The Hoffman-Singleton Graph and its Automorphisms
TL;DR: The Hoffman-Singleton graph is closely related to the incidence graph of the affine plane over Bbb Z5 as mentioned in this paper, which allows us to construct all automorphisms of the graph.
Journal ArticleDOI
On Linear Representations of Near Hexagons
B. De Bruyn,F. De Clerck +1 more
TL;DR: If the dimension of the affine space is at least eight, then the near hexagon necessarily contains a quad of typeT*2(O) and every such quad has a rosette of ovoids and it is conjecture that there are no such examples.
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.