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
GF(2)-expansions
TL;DR: In this article, the authors studied universal covers of certain geometries arising from hyperbolic quadrics and symplectic varieties over GF and proved that the geometry obtained by applying this construction to matroids are simply connected.
Journal ArticleDOI
The Hoffman number of a graph
TL;DR: The Hoffman number is studied for a connected graph G with n vertices, where µ(G) is defined by λ1 λ2 ... λr/n.
DissertationDOI
On highly regular digraphs
TL;DR: In this paper, directed strongly regular graphs (DSRGs) and their connections to association schemes and finite incidence structures are studied and a connection between the two structures and digraphs is established.
Book ChapterDOI
Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics
Aiso Heinze,Mikhail Klin +1 more
TL;DR: Using in conjunction computer packages GAP and COCO an efficient algorithmic approach for the investigation of automorphism groups of geometric Latin square graphs is established and an infinite series of proper loops is presented which have a sharply transitive group of collineations.
Journal ArticleDOI
Extended F4-buildings and the Baby Monster
TL;DR: In this article, the problem of flag-transitive automorphism in the Baby Monster graph has been studied, and it has been shown that there exists a graph Ω(B) with diagrams c.F4(2) and c. F4(1) satisfying (a) and (b) the following properties: (1) any two elements of type 1 are incident to at most one common element of type 2 if and only if they were incident to a common element from type 5.
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.