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
On calibrated representations and the Plancherel Theorem for affine Hecke algebras
TL;DR: In this paper, the authors generalize Ram's combinatorial construction of calibrated representations of the affine Hecke algebra to the multi-parameter case (including the non-reduced BC n case).
Journal ArticleDOI
Asymptotic Delsarte cliques in distance-regular graphs
László Babai,John Wilmes +1 more
TL;DR: A new bound on the parameter $\lambda $$λ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph G is given, improving and generalizing bounds for strongly regular graphs by Spielman (1996) and Pyber (2014. arXiv:1409.3041).
Journal ArticleDOI
Pseudo-Strong Regularity Around a Set
Miguel Angel Fiol,E. Garriga +1 more
TL;DR: A generalization of strong regularity around a vertex subset C of a graph γ, which makes sense even if γ is non-regular, is studied in this article.
Journal ArticleDOI
On the multiplicity-free actions of the sporadic simple groups
TL;DR: In this article, the character tables of the endomorphism rings of the multiplicity-free permutation modules of the sporadic simple groups, their automorphism groups, and their Schur covers are presented.
Posted Content
Relative t-designs in binary Hamming association scheme H(n,2)
TL;DR: In this article, the existence of tight relative t-designs in H(n,2) was studied, and a strong restriction on the possible parameters of such designs was given.
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.