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
Non-isomorphic graphs with cospectral symmetric powers
TL;DR: It is shown that given a positive integer $m$ there exist infinitely many pairs of non-isomorphic graphs with cospectral symmetry powers, based on theory of multidimensional extensions of coherent configurations.
Journal ArticleDOI
Singular linear space and its applications
Kaishun Wang,Jun Guo,Fenggao Li +2 more
TL;DR: Two anzahl theorems in singular linear spaces are given and their applications to the constructions of Deza digraphs, quasi-strongly regular graphs, lattices and authentication codes are discussed.
Journal ArticleDOI
On automorphisms of distance-regular graphs with intersection array {56, 45, 1; 1, 9, 56}
Journal ArticleDOI
Regular Maps from Voltage Assignments and Exponent Groups
Roman Nedela,Martin Škoviera +1 more
TL;DR: A common generalization of two methods of construction of regular maps on surfaces that produce graph covering projections that extend to coverings of regular embeddings of the graphs involved and a double covering projection of graphs which, in general, need not be extendable to a covering ofregular maps.
Journal ArticleDOI
Can one see the signs of structure constants
TL;DR: In this article, it was shown that one can see the signs of action structure constants directly in the weight diagram of microweight and adjoint representations for groups of types E6, E7, and E8.
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.