Antipodal covering graphs
From MaRDI portal
Publication:2562870
Cites work
- A new 5‐arc‐transitive cubic graph
- Applications of a theorem on partitioned matrices
- Homological Coverings of Graphs
- scientific article; zbMATH DE number 3224340 (Why is no real title available?)
- scientific article; zbMATH DE number 3259777 (Why is no real title available?)
- Imprimitive distance-regular graphs and projective planes
- On Minimal graphs of maximum even girth
- On Moore Graphs with Diameters 2 and 3
- On Trivalent Graphs
- PRIMITIVE AND IMPRIMITIVE GRAPHS
- Quasi-block-stochastic matrices
Cited in
(46)- Imprimitive distance-transitive graphs with primitive core of diameter at least 3
- Geodetic graphs of diameter two and some related structures
- A class of distance-regular graphs that are \(\phi\)-polynomial
- Distance-transitive representations of the symmetric groups
- Automorphism groups of primitive distance-bitransitive graphs are almost simple
- A characterization of the association schemes of bilinear forms
- Finite common coverings of pairs of regular graphs
- Finite common coverings of graphs
- Antipodal graphs of diameter three
- Almost rank three graphs
- Second neighbourhoods of strongly regular graphs
- Distance regular covers of the complete graph
- An improved version of Lloyd's theorem
- Nearly perfect codes in distance-regular graphs
- Embeddings of covering projections of graphs
- Homogeneity conditions in graphs
- Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers
- Distance-transitive antipodal covers: The extremal case
- Quotients of association schemes
- Antipodal covers of strongly regular graphs
- On 2-arc-transitivity of Cayley graphs
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Antipodal covers of distance-transitive generalized polygons
- Covers of complete graphs and related association schemes
- List covering of regular multigraphs
- Graph covers with two new eigenvalues
- The Sylvester graph and Moore graphs
- Families of nested completely regular codes and distance-regular graphs
- The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
- Imprimitive distance-regular graphs and projective planes
- Distance-transitive graphs of valency five
- Double covers of graphs
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- On the metric dimension of imprimitive distance-regular graphs
- On a class of edge-transitive distance-regular antipodal covers of complete graphs
- Merging the first and third classes in bipartite distance-regular graphs
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- Distance-regular antipodal covering graphs
- List covering of regular multigraphs with semi-edges
- Equi-isoclinic subspaces, covers of the complete graph, and complex conference matrices
- Computational complexity of covering multigraphs with semi-edges: small cases
- 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
- Computational complexity of covering regular trees
- Distance-transitive representations of groups G with \(PSL_ 2(q)\trianglelefteq G\leq P\Gamma L_ 2(q)\)
- Imprimitive cometric association schemes: constructions and analysis
- Classification of 2-arc-transitive dihedrants
This page was built for publication: Antipodal covering graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562870)
