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
Book ChapterDOI
Massively Parallel Graph Partitioning: A Case in Human Bone Simulations
Costas Bekas,Alessandro Curioni,Peter Arbenz,Cyril Flaig,G.H. van Lenthe,R. Mu¨ller,A.J. Wirth +6 more
TL;DR: In this paper, a direct mapping of peripheral quantitative computed tomography (pQCT) voxels to bone elements is presented. But, the analysis of bone density is today's standardapproach of predicting bone strength and fracture risk in diseases like osteoporosis.
Journal ArticleDOI
Tight sets and m-ovoids of finite polar spaces
TL;DR: The techniques developed in this paper are used to give an alternative proof of a result of Thas, m-ovoid and spreads of finite classical polar spaces, that an m-system of W(4m+3,q) or Q* is a pseudo-ovoids of the ambient projective space.
Book ChapterDOI
Strongly Regular Graphs
TL;DR: In this paper, a graph (simple, undirected, and loopless) of order v is called strongly regular with parameters v, k,λ,μ whenever it is not complete or edgeless.
Journal ArticleDOI
A Group-Theoretic Framework for the Construction of Packings in Grassmannian Spaces
TL;DR: By using totally isotropic subspaces in an orthogonal space Ω+ (2i, 2), several infinite families of packings of 2k-dimensional subspace of real 2i-dimensional space are constructed, some of which are shown to be optimal as discussed by the authors.
Journal ArticleDOI
Algebraic theory of recombination spaces
TL;DR: It is concluded that the algebraic approach to fitness landscape analysis can be extended to recombination spaces and provides an effective way to analyze the relative hardness of a landscape for a given recombination operator.
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.