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
Q -polynomial distance-regular graphs with a 1 = 0
TL;DR: It is shown that every Q-polynomial distance-regular graph with diameter d ≥ 2 and intersection number a 1 = 0 is 1-homogeneous in the sense of Nomura.
Journal ArticleDOI
Examples of computer experimentation in algebraic combinatorics
TL;DR: Certain paradigms for procuring computer-free explanations from data acquired via computer algebra experimentation are introduced, and special attention is paid to algebraic automorphisms (of a coherent algebra), a fairly new concept that has already proved to have far-reaching consequences.
Journal ArticleDOI
Geometric Characterization of Graphs from the Suzuki Chain
TL;DR: The graphs from the Suzuki chain 12 are classified connected locally ?
Posted Content
Strongly regular graphs with no triangles
TL;DR: In this paper, a simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles, which leads to direct proofs of the Krein conditions, and the characterization of strong regular graphs with no triangles such that the second subconstituent is also strongly regular.
Journal ArticleDOI
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar,Primo Šparl +1 more
TL;DR: It is shown that every distance-transitive graph admits a semiregular automorphism of the graph mapping u to u and v to v.
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.