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
Bilinear forms graphs over residue class rings
TL;DR: In this article, the authors investigated the bilinear forms graph Γ over the residue class ring modulo p s (where p is a prime number and s is a positive integer).
Journal ArticleDOI
Some Properties of a Cayley Graph of a Commutative Ring
TL;DR: In this article, the clique number, chromatic number, edge chromatic numbers, domination number, and the girth of a commutative ring R with unity and R +, U(R), and Z*(R) were characterized.
Journal ArticleDOI
A Unified Approach to a Characterization of Grassmann Graphs and Bilinear Forms Graphs
Tung-Shan Fu,Tayuan Huang +1 more
TL;DR: Inspired by Wilbrink and Brouwer's proved that certain semi-partial geometries with some weak restrictions on parameters satisfy the dual of Pasch's axiom, a class of incidence structures associated with distance-regular graphs with classical parameters is studied.
Journal ArticleDOI
Dynamical invariants in the deterministic fixed-energy sandpile
TL;DR: In this article, the authors studied the nonergodic behavior of the deterministic fixed energy sandpile with Bak-Tang-Wiesenfeld (BTW) rule and showed that the toppling invariants exhibit a highly irregular behavior.
Journal ArticleDOI
On geodesic transitive graphs
TL;DR: It is shown that for each value of s ?
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.