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
Tight distance-regular graphs with respect to subsets
Rie Hosoya,Hiroshi Suzuki +1 more
TL;DR: A homogeneity property of a tight graph with respect to a completely regular code is studied.
Journal ArticleDOI
A geometrical characterization of strongly regular graphs
Hiroshi Nozaki,Masashi Shinohara +1 more
TL;DR: In this paper, a necessary and sufficient condition of a Euclidean representation of a simple graph to be spherical is given, and a characterization of strongly regular graphs from the view point of Euclideans representations of a graph is given.
Proceedings ArticleDOI
Distributed computation of tensor decompositions in collaborative networks
TL;DR: It is shown that average consensus based estimation is useful to yield unique estimates of the factor matrices of each data sub-tensor at the central unit, which is particularly useful when dealing with large-scale data tensors.
Journal ArticleDOI
Algebraic Characterizations of Graph Regularity Conditions
TL;DR: It is shown that several other graph regularity conditions involving pairs and triples of vertices also have ideal theoretic characterizations in some appropriate algebras.
Journal ArticleDOI
Cameron-Liebler sets of k-spaces in PG(n,q)
TL;DR: In this paper, a generalization of known results about Cameron-Liebler line sets was presented, and several equivalent definitions for these line sets were presented. But these definitions were based on the same line sets of k-spaces.
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.