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
Journal ArticleDOI
Nowhere-zero eigenvectors of graphs
TL;DR: In this paper, it was shown that distance-regular graphs and vertex-transitive graphs have nowhere-zero eigenvectors for all of their eigenvalues and edge-transitives have none for all non-zero values.
Posted Content
The generating rank of the unitary and symplectic Grassmannians
TL;DR: It is proved that the Grassmannian of totally isotropic k-spaces of the polar space associated to the unitary group SU"2"n(F) (n@?N) has generating rank (2nk) when F F"4.
Journal ArticleDOI
Distance regularity in direct-product graphs
TL;DR: The direct product G × H of distance-regular graphs is investigated and it is demonstrated that the product is distance- regular only when G and H are very restricted distance-Regular graphs.
Journal ArticleDOI
Distance-regular Cayley graphs with least eigenvalue $$-2$$-2
TL;DR: In this paper, the distance-regular Cayley line graphs with least eigenvalue ≥ 3 and diameter ≥ 3 were classified into lattice graphs, triangular graphs, and line graphs of incidence graphs of certain projective planes.
Journal ArticleDOI
Kite-free P - and Q -polynomial schemes
TL;DR: A 4-tuplexyzu kite of lengthi (2 ≤ i ≤ d) inY, a aP-polynomial association scheme, where Y is a kitesurfer of length 2, i≤i≤d and X is a Polynomial Association Scheme.
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.