Semisymmetric graphs (Q932665): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Edge but not Vertex Transitive Cubic Graph<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge but not vertex transitive regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A census of semisymmetric cubic graphs on up to 768 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(2\)-arc-transitive covers of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular line-symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-regular cubic graphs of order a small number times a prime or a prime square / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>s</i>‐Regular cubic graphs as coverings of the complete bipartite graph <i>K</i><sub>3,3</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying cubic symmetric graphs of order \(8p\) or \(8p^2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(s\)-regular cyclic coverings of the three-dimensional hypercube \(Q_{3}\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite series of regular edge- but not vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive graphs: Symmetric graphs of prime valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group actions, coverings and lifts of automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semisymmetric elementary Abelian covers of the Möbius-Kantor graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary abelian covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cubic graphs admitting an edge-transitive solvable group / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite family of cubic edge- but not vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic edge-transitive graphs of order 2\(p^{3}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting graph automorphisms by voltage assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant subspaces, duality, and covers of the Petersen graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing cubic edge- but not vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semisymmetry of generalized Folkman graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semisymmetric cubic graphs of twice odd order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5785712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Symmetry of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A worthy family of semisymmetric graphs / rank
 
Normal rank

Revision as of 12:23, 28 June 2024

scientific article
Language Label Description Also known as
English
Semisymmetric graphs
scientific article

    Statements

    Semisymmetric graphs (English)
    0 references
    0 references
    0 references
    11 July 2008
    0 references
    In a recent paper in [Discrete Math. 307, No. 17--18, 2156--2175 (2007; Zbl 1136.05026)], \textit{A. Malnič, D. Marušič, S. Miklavič} and \textit{P. Potočnik} gave constructions for all pairwise non-isomorphic minimal semisymmetric elementary abelian covers of the Möbius-Kantor graph -- a 16-vertex 3-valent arc-transitive graph, known also as the generalized Petersen graph GP\((8,3)\). The automorphism group of this graph has a rich subgroup structure, making the problem of finding covers considerably more complex than, say, covers of the Petersen graph or the Heawood graph. It was remarked at the end of that paper that the minimal covering graphs arising from the given constructions need not always be semisymmetric. In this paper, it is shown that they are never arc-transitive, and so are always semisymmetric.
    0 references
    Möbius-Kantor graph
    0 references
    generalized Petersen graph
    0 references
    semisymmetric graph
    0 references
    arc-transitive graph
    0 references
    covering graph
    0 references
    automorphism group
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers