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
Dynamic classification method of fault indicators for bearings’ monitoring
TL;DR: A dynamic classification method inspired by DBSCAN clustering method for machine condition monitoring in general and for bearings in particular, which led to the conclusion that DBS CAN is more adapted to vibratory signals.
Journal ArticleDOI
On (0,α)-Geometries and Dual Semipartial Geometries Fully Embedded in an Affine Space
F. De Clerck,M. Delanote +1 more
TL;DR: This work investigates the case where the (0,α)-geometry, fully embedded in AG(n,q), is the dual of a semipartial geometry and gives a characterization of the most important model.
Proceedings ArticleDOI
One Dimensional Cross-Correlation Methods For Deterministic And Stochastic Graph Signals With A Twitter Application In Julia
TL;DR: Methods from a broad class of cross-correlation methodologies which convert deterministic graphs to one dimensional signals are examined and are extended to a class of random graphs with the latter being treated as stochastic signals.
Journal ArticleDOI
Suborbits of subspaces of type (m, k) under finite singular general linear groups
Kaishun Wang,Jun Guo,Fenggao Li +2 more
TL;DR: In this paper, the length of each suborbit of a symmetric association scheme was determined and the rank of all the orbitals and the intersection numbers of the symmetric associations were derived.
Journal ArticleDOI
Finite Variable Logic, Stability and Finite Models
TL;DR: This work will study complete Ln-theories and their models, where Ln is the set of first order formulas in which at most n distinct variables occur, and derive that T has arbitrarily large finite models.
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.