Arc-transitive dihedral regular covers of cubic graphs (Q405283): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-transitive abelian regular covers of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined classification of symmetric cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular groups of automorphisms of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 4-valent symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-transitive abelian regular covering graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary abelian covers of graphs / rank
 
Normal rank

Latest revision as of 23:50, 8 July 2024

scientific article
Language Label Description Also known as
English
Arc-transitive dihedral regular covers of cubic graphs
scientific article

    Statements

    Arc-transitive dihedral regular covers of cubic graphs (English)
    0 references
    0 references
    4 September 2014
    0 references
    Summary: A regular covering projection is called dihedral or abelian if the covering transformation group is dihedral or abelian. A lot of work has been done with regard to the classification of arc-transitive abelian (or elementary abelian, or cyclic) covers of symmetric graphs. In this paper, we investigate arc-transitive dihedral regular covers of symmetric (arc-transitive) cubic graphs. In particular, we classify all arc-transitive dihedral regular covers of \(K_4\), \(K_{3,3}\), the 3-cube \(Q_3\) and the Petersen graph.
    0 references
    arc-transitive graph
    0 references
    regular cover
    0 references
    dihedral cover
    0 references
    cubic graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references