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
Multilevel Artificial Neural Network Training for Spatially Correlated Learning
Cory B. Scott,Eric Mjolsness +1 more
TL;DR: In this paper, a multigrid modeling algorithm is used to accelerate iterative method models running on a hierarchy of similar graphlike structures, and a new method for traini...
Journal ArticleDOI
On the Koolen–Park inequality and Terwilliger graphs
TL;DR: It is proved that $\Gamma$ is the icosahedron, the Doro graph or the Conway–Smith graph if equality is attained and $c_2\ge 2$.
Posted Content
The endomorphism of Grassmann graphs
TL;DR: This paper shows that every Grassmann graph J_q(n,m) is a pseudo-core and is a core whenever $m$ and $n-m+1$ are not relatively prime.
Journal ArticleDOI
A duality between pairs of split decompositions for a Q-polynomial distance-regular graph
TL;DR: In this article, it was shown that the split decomposition of a Q-polynomial distance-regular graph is dual with respect to the standard Hermitian decomposition on the standard module V.
Journal ArticleDOI
Characterizations of Certain Types of Type 2 Soft Graphs
TL;DR: Type 2 soft graphs on underlying subgraphs of a simple graph are characterized by presenting several examples to demonstrate these new concepts and introducing type 2 soft cycles, type 2Soft cut-nodes, and type 2soft bridges.
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.