Distance regular covers of the complete graph
From MaRDI portal
Publication:1204463
DOI10.1016/0095-8956(92)90019-TzbMath0771.05031MaRDI QIDQ1204463
Publication date: 10 March 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS, The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results, Pretty good state transfer in discrete-time quantum walks, 2-arc-transitive cyclic covers of \(K_{n,n}\), Arc-transitive antipodal distance-regular covers of complete graphs related to \(\mathrm{SU}_3(q)\), Random fusion frames are nearly equiangular and tight, A family of antipodal distance-regular graphs related to the classical Preparata codes, On the multiplicity of eigenvalues of distance-regular graphs, Covers of complete graphs and related association schemes, ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS, Distance-regular Cayley graphs on dihedral groups, Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\), Overlarge sets and partial geometries, Tremain equiangular tight frames, 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\}\), Optimal linear transmission by loss-insensitive packet encoding, Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case, On a class of vertex-transitive distance-regular covers of complete graphs. II, Equiangular lines and covers of the complete graph, 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, New families of completely regular codes and their corresponding distance regular coset graphs, Distance-regular Cayley graphs over dicyclic groups, 2-ARC-TRANSITIVE REGULAR COVERS OF HAVING THE COVERING TRANSFORMATION GROUP, Typical circulant double coverings of a circulant graph., Relative difference sets fixed by inversion. III: Cocycle theoretical approach, Some results on covers of complete graphs, Graph covers with two new eigenvalues, Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\), Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3, Doubly transitive lines. I: Higman pairs and roux, Spreads in strongly regular graphs, On the metric dimension of imprimitive distance-regular graphs, Spectra and eigenspaces of arbitrary lifts of graphs, Second neighbourhoods of strongly regular graphs, Frames as Codes, 2-arc-transitive cyclic covers of \(K_{n,n}-nK_2\), Distance regular covers of the complete graph, Relative difference sets fixed by inversion and Cayley graphs, 2-arc-transitive metacyclic covers of complete graphs, 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\), Circulant double coverings of a circulant graph of valency four, The spectra of lifted digraphs, 2-arc-transitive regular covers of $K_{n,n}$ having the covering transformation group $\mathbb{Z}_p^2$, On a class of vertex-transitive distance-regular covers of complete graphs, Nonregular graphs with three eigenvalues, Another construction of edge-regular graphs with regular cliques, Commutative association schemes, Polyphase equiangular tight frames and abelian generalized quadrangles, Three-class association schemes, 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)\)
Cites Work
- Distance regular graphs of diameter 3 and strongly regular graphs
- Bounding the diameter of distance. Regular graphs
- Feasibility conditions for the existence of walk-regular graphs
- Distance regular covers of the complete graph
- Two infinite classes of perfect codes in metrically regular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Equiangular lines
- Antipodal covering graphs
- Distance-Regular Graphs with Diameter Three
- Combinatorial Properties of Group Divisible Incomplete Block Designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
