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
The Terwilliger Algebra of a Distance-Regular Graph that Supports a Spin Model
John S. Caughman,Nadine Wolff +1 more
TL;DR: In this paper, the intersection number of a distance-regular graph with vertex set X, diameter D? 3, valency k? 3 and support of a spin model W is determined by the multiplicities with which irreducible T-modules appear in the standard module.
Journal ArticleDOI
Toughness and spectrum of a graph
TL;DR: In this article, lower bounds for the toughness of a graph in terms of its eigenvalues were derived, and the best possible lower bounds were derived for each eigenvalue.
Journal ArticleDOI
On linguistic dynamical systems, families of graphs of large girth, and cryptography
TL;DR: In this paper, a linguistic dynamical system of dimension n ≥ 2 over an arbitrary commutative ring K is studied, where the graph of the dynamical systems is a tree.
Journal ArticleDOI
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
TL;DR: A unified explanation of various association schemes on 28 points, including those of pseudocyclic and quasithin type, plus some of pseudotriangular type are given, and computer-free proofs that these schemes are in fact attainable via appropriate mergings of classes from S are provided.
Journal ArticleDOI
Association Schemes and Fusion Algebras (An Introduction)
TL;DR: The concept of fusion algebras at algebraic level has been introduced in this paper for the fusion algebra which appears in conformal field theory in mathematical physics and has been shown to have modular invariance properties.
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.