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
Book ChapterDOI
Enumeration of Schur Rings Over Small Groups
TL;DR: By optimizing the algorithms used in C OCO and COCO-II, all Schur rings over the groups of orders up to 63 are enumerated.
Journal ArticleDOI
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
TL;DR: It is proved that @C is an antipodal cover of a strongly regular graph, which means that it has diameter 4 or 5, and it is shown that there are no distance-regular graphs with this intersection array.
Journal ArticleDOI
Distance-regular graphs with G x s3* K a +1
TL;DR: In this paper, it was shown that a distance-regular graph with vertices of valency 3 can be denoted by at most four parameters, i.e., intersection numbers ci, ai, bi (0 ⩽ i⩽ d) can be defined by four parameters.
Journal ArticleDOI
Predicting state transitions in brain dynamics through spectral difference of phase-space graphs
TL;DR: This research proposes objective indications of seizure onset observed from minimally invasive scalp EEG, and considers the brain as a complex nonlinear dynamical system whose state can be derived through time-delay embedding of the EEG data and characterized to determine change in brain dynamics related to the preictal state.
Journal ArticleDOI
Cayley continuants
Emanuele Munarini,Damiano Torri +1 more
TL;DR: The main aim of this paper is to give a straightforward proof of Cayley's identity using the method of formal series and umbral calculus techniques to obtain several other identities.
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.