Elementary abelian covers of graphs
From MaRDI portal
Publication:703040
The authors investigate the set of all equivalence classes of regular covering projections of a given connected graph, along which a given subgroup of the automorphism group of the graph lifts. This set has a natural lattice structure induced by factorisation of coverings. The sublattice of all coverings that are below a given covering then corresponds to a lattice of certain subgroups of the group of covering transformations. This correspondence is studied (in the language of voltage assignments) in considerable depth, including an explicit algorithm to find the sublattice with an elementary abelian \(p\)-group of covering transformations.
Recommendations
- scientific article; zbMATH DE number 5943489
- Invariant subspaces, duality, and covers of the Petersen graph
- Graph covering projections arising from finite vector spaces over finite fields
- Linear criteria for lifting automorphisms of elementary abelian regular coverings
- Arc-transitive abelian regular covers of cubic graphs
Cites work
- 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
- s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3
- A census of semisymmetric cubic graphs on up to 768 vertices
- A contribution to the theory of voltage graphs
- A worthy family of semisymmetric graphs
- An infinite family of cubic edge- but not vertex-transitive graphs
- Automorphisms of graphs and coverings
- Coverings of graphs and maps, orthogonality, and eigenvectors
- Cyclic matrices and the MEATAXE
- Graph covering projections arising from finite vector spaces over finite fields
- Homological Coverings of Graphs
- Homological methods in algebraic map theory.
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 682071 (Why is no real title available?)
- scientific article; zbMATH DE number 3085223 (Why is no real title available?)
- Lifting graph automorphisms by voltage assignments
- Linear criteria for lifting automorphisms of elementary abelian regular coverings
- The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
- The Magma algebra system. I: The user language
- Typical circulant double coverings of a circulant graph.
Cited in
(92)- A classification of cubic \(s\)-regular graphs of order 16\(p\)
- A classification of cubic \(s\)-regular graphs of order \(14p\)
- Arc-transitive elementary abelian covers of the Pappus graph
- Action graphs and coverings
- \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\).
- Linear criteria for lifting automorphisms of elementary abelian regular coverings
- On arc-transitive metacyclic covers of graphs with order twice a prime
- The automorphism groups of arc-transitive abelian \(p\)-covers of \(K_5\)
- Tetravalent vertex- and edge-transitive graphs over doubled cycles
- Tetravalent arc-transitive graphs of order twice a product of two primes
- Graph covering projections arising from finite vector spaces over finite fields
- How to find \(G\)-admissible abelian regular coverings of a graph?
- Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn
- Cubic edge-transitive graphs of order 2ⁿp
- List covering of regular multigraphs
- Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices
- Graphs that contain multiply transitive matchings
- On a representation of the automorphism group of a graph in a unimodular group
- Elementary abelian regular coverings of Platonic maps
- Cubic semisymmetric graphs of order 2qp^2
- Some computational aspects of solvable regular covers of graphs
- Self-complementary two-graphs and almost self-complementary double covers
- Arc-transitive abelian regular covers of cubic graphs
- Constructing even radius tightly attached half-arc-transitive graphs of valency four
- On 2-fold covers of graphs
- Invariant subspaces, duality, and covers of the Petersen graph
- A census of semisymmetric cubic graphs on up to 768 vertices
- Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\)
- Pentavalent symmetric graphs of order twice a prime power
- Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
- Generalised voltage graphs
- On the split structure of lifted groups
- Locally 3-arc-transitive regular covers of complete bipartite graphs
- Testing whether the lifted group splits
- On graphs of prime valency admitting a solvable arc-transitive group
- Edge-transitive regular metacyclic covers of the Petersen graph
- scientific article; zbMATH DE number 5943489 (Why is no real title available?)
- Classification of cubic vertex-transitive tricirculants
- Pentavalent symmetric graphs of order 2p^3
- A classification of cubic symmetric graphs of order 16p^2
- Lifting automorphisms along abelian regular coverings of graphs
- Cubic symmetric graphs of order \(8p^3\)
- Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2p
- On cyclic regular covers of complete graphs of small order
- Arc-transitive dihedral regular covers of cubic graphs
- Arc-regular cubic graphs of order four times an odd integer
- Efficient domination in cubic vertex-transitive graphs
- On split liftings with sectional complements
- Classification of Regular Embeddings of Complete Multipartite Graphs
- Arc-transitive cyclic and dihedral covers of pentavalent symmetric graphs of order twice a prime
- Symmetric graphs of order four times a prime power and valency seven
- On the orders of arc-transitive graphs
- Symmetric cubic graphs with solvable automorphism groups
- Arc-transitive regular cyclic covers of the complete bipartite graph \(\mathsf{K}_{p,p}\)
- Lifting graph automorphisms along solvable regular covers
- Arc-transitive cyclic covers of graphs with order twice a prime
- Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8
- Semisymmetric \(Z_p\)-covers of the \(C20\) graph
- Lifting a prescribed group of automorphisms of graphs
- On the order of arc-stabilisers in arc-transitive graphs with prescribed local group
- The universal abelian cover of a graph manifold
- Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms
- Arc-transitive elementary abelian covers of the complete graph \(K_{5}\)
- Three local actions in 6‐valent arc‐transitive graphs
- Semisymmetric elementary abelian covers of the Heawood graph
- Graph Coverings and (Im)primitive Homology: Examples of Low Degree
- List covering of regular multigraphs with semi-edges
- Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A
- Cubic vertex-transitive graphs admitting automorphisms of large order
- 2-Uniform covering groups of elementary abelian 2-groups
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- Edge-transitive cyclic regular covers of the Möbius-Kantor graph
- Computational complexity of covering coloured mixed multigraphs with simple degree partitions
- Computational complexity of covering multigraphs with semi-edges: small cases
- On Sylow-covers of cubic arc-transitive graphs
- Coverings of general digraphs
- On cubic polycirculant nut graphs
- Normal covers of 2-arc-transitive graphs of prime-power order
- On p-radical covers of pentavalent arc-transitive graphs
- On cubic graphs admitting an edge-transitive solvable group
- Cubic semisymmetric graphs of order \(6p^{3}\)
- Abelian groups without 3-chromatic Cayley graphs
- Computational complexity of covering regular trees
- Cubic semisymmetric graphs of order \(8p ^{3}\)
- On fixity of arc-transitive graphs
- Classifying cubic symmetric graphs of order \(10p\) or \(10p^{2}\)
- Cubic symmetric graphs of order a small number times a prime or a prime square
- Finite edge-transitive oriented graphs of valency four: a global approach
- Semisymmetric graphs
- Arc-transitive elementary Abelian covers of the octahedron graph
- Edge-transitive regular \(Z_n\)-covers of the Heawood graph
- Rose window graphs underlying rotary maps
This page was built for publication: Elementary abelian covers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703040)
