Distance regular covers of the complete graph
From MaRDI portal
A graph \(G\) is distance regular if for any two vertices \(u\) an \(v\) the number of vertices being at distance \(i\) from \(u\) and \(j\) from \(v\) depends on \(i\) and \(j\) only. \(G\) is called antipodal if the vertices at distance \(d\) from a given vertex are also at distance \(d\) from each other. Authors prove necessary existence conditions for distance regular antipodal graphs of diameter 3 in terms of three parameters assigned to each such graph, and give a new construction for such graphs generalising a known one by Thas and Somma. They also investigate the relationship of distance regular antipodal graphs to other fields like design and coding theory.
Recommendations
Cites work
- Antipodal covering graphs
- Bounding the diameter of distance. Regular graphs
- Combinatorial Properties of Group Divisible Incomplete Block Designs
- Distance regular covers of the complete graph
- Distance regular graphs of diameter 3 and strongly regular graphs
- Distance-Regular Graphs with Diameter Three
- Distance-regularised graphs are distance-regular or distance-biregular
- Equiangular lines
- Feasibility conditions for the existence of walk-regular graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3851135 (Why is no real title available?)
- scientific article; zbMATH DE number 3871186 (Why is no real title available?)
- scientific article; zbMATH DE number 3877205 (Why is no real title available?)
- scientific article; zbMATH DE number 3670480 (Why is no real title available?)
- scientific article; zbMATH DE number 3745240 (Why is no real title available?)
- scientific article; zbMATH DE number 3760444 (Why is no real title available?)
- scientific article; zbMATH DE number 166092 (Why is no real title available?)
- scientific article; zbMATH DE number 3510326 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3428111 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3421490 (Why is no real title available?)
- Two infinite classes of perfect codes in metrically regular graphs
Cited in
(78)- Commutative association schemes
- Second neighbourhoods of strongly regular graphs
- Distance regular covers of the complete graph
- Nonregular graphs with three eigenvalues
- Three-class association schemes
- Three new distance-regular graphs
- Overlarge sets and partial geometries
- Typical circulant double coverings of a circulant graph.
- Some results on covers of complete graphs
- Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
- 2-arc-transitive cyclic covers of \(K_{n,n}\)
- On automorphisms of a distance-regular graph with intersection array \(\{96,76,1;1,19,96\}\)
- Automorphisms of graph with intersection array \(\{289,216,1;1,72,289\}\)
- Automorphisms of graph with intersection array \(\{232,198,1;1,33,232\}\)
- Distance regular covers of complete graphs from Latin squares
- 2-arc-transitive regular covers of $K_{n,n}$ having the covering transformation group $\mathbb{Z}_p^2$
- A family of antipodal distance-regular graphs related to the classical Preparata codes
- On the multiplicity of eigenvalues of distance-regular graphs
- On a class of vertex-transitive distance-regular covers of complete graphs
- Covers of complete graphs and related association schemes
- Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case
- Graph covers with two new eigenvalues
- Doubly transitive lines. I: Higman pairs and roux
- Spectra and eigenspaces of arbitrary lifts of graphs
- 2-arc-transitive cyclic covers of \(K_{n,n}-nK_2\)
- 2-arc-transitive metacyclic covers of complete graphs
- The spectra of lifted digraphs
- Another construction of edge-regular graphs with regular cliques
- Polyphase equiangular tight frames and abelian generalized quadrangles
- Families of nested completely regular codes and distance-regular graphs
- Perfect state transfer on distance-regular graphs and association schemes
- Two new infinite families of arc-transitive antipodal distance-regular graphs of diameter three with \(\lambda =\mu \) related to groups \(\mathrm{Sz}(q)\) and \(^2G_2(q)\)
- The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
- Arc-transitive antipodal distance-regular covers of complete graphs related to \(\mathrm{SU}_3(q)\)
- Tremain equiangular tight frames
- New families of completely regular codes and their corresponding distance regular coset graphs
- Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
- Relative difference sets fixed by inversion and Cayley graphs
- Circulant double coverings of a circulant graph of valency four
- Random fusion frames are nearly equiangular and tight
- On a class of vertex-transitive distance-regular covers of complete graphs. II
- Distance-regular Cayley graphs over dicyclic groups
- On D. G. Higman's note on regular 3-graphs
- 2-arc-transitive regular covers of \(K_{n,n}-nK_2\) having the covering transformation group \(\mathbb{Z}_p^3\)
- scientific article; zbMATH DE number 4181387 (Why is no real title available?)
- Edge-symmetric distance-regular covers of cliques with =
- scientific article; zbMATH DE number 15084 (Why is no real title available?)
- scientific article; zbMATH DE number 563236 (Why is no real title available?)
- Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)
- scientific article; zbMATH DE number 926602 (Why is no real title available?)
- Frames as codes
- On the metric dimension of imprimitive distance-regular graphs
- On a class of edge-transitive distance-regular antipodal covers of complete graphs
- ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
- Pretty good state transfer in discrete-time quantum walks
- Distance-regular antipodal covering graphs
- Doubly transitive lines. II: Almost simple symmetries
- On the order of antipodal covers
- On the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs
- Constructing linked systems of relative difference sets via Schur rings
- Equi-isoclinic subspaces, covers of the complete graph, and complex conference matrices
- Spectra and eigenspaces of arbitrary lifts of graphs
- On locally n n grid graphs
- On G-vertex-transitive covers of complete graphs having at most two G-orbits on the arc set
- Spreads in strongly regular graphs
- On the optimal arrangement of \(2d\) lines in \(\mathbb{C}^d\)
- Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
- Distance-regular Cayley graphs over \(\mathbb{Z}_{p^s} \oplus \mathbb{Z}_p\)
- 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
- Roux schemes which carry association schemes locally
- Neumaier graphs from cyclotomy with small coherent rank
- Complex Hadamard matrices and strongly regular graphs
- Distance regular graphs of diameter 3 and strongly regular graphs
- Distance-regular Cayley graphs on dihedral groups
- Optimal linear transmission by loss-insensitive packet encoding
- On isomorphism between distance-regular graphs
- Equiangular lines and covers of the complete graph
- Relative difference sets fixed by inversion. III: Cocycle theoretical approach
This page was built for publication: Distance regular covers of the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1204463)
