Open AccessBook
Distance-Regular Graphs
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
The Second Eigenvalue of Regular Graphs of Given Girth
TL;DR: In this paper, the authors approximate the discrete spectrum of a finite regular graph by the continuous spectrum of an infinite regular tree, and then the associated orthogonal poly- nomials coincide up to a degree equal to half the girth.
On graphs, geometries, and groups of Lie type
TL;DR: A submitted manuscript is the version of the article upon submission and before peer-review as discussed by the authors, while a published version is the final layout of the paper including the volume, issue and page numbers.
Journal ArticleDOI
Chromatic invariants for finite graphs: Theme and polynomial variations
TL;DR: In this paper, generalized chromatic invariants are obtained by counting morphisms from X to the q th graph of a given sequence Y ∗ = (Y q ) q ⩾1.
Journal ArticleDOI
Adjacency preservers, symmetric matrices, and cores
TL;DR: In this paper, it was shown that the graph Γ n that has all n×n symmetric matrices over a finite field as the vertex set, with two matrices being adjacent if and only if the rank of their difference equals one, is a core if n?3.
Journal ArticleDOI
A census of infinite distance-transitive graphs
TL;DR: This paper describes some classes of infinite distance-transitive graphs, which have no finite analogues and has no pretensions to give a complete list.
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.