Odd extensions of transitive groups via symmetric graphs – The cubic case
| Autor: | Dragan Marušič, Klavdija Kutnar |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Vertex (graph theory)
Automorphism group Transitive relation 010102 general mathematics Parity of a permutation 0102 computer and information sciences 16. Peace & justice Automorphism 01 natural sciences Graph Theoretical Computer Science Combinatorics Mathematics::Group Theory Computational Theory and Mathematics 010201 computation theory & mathematics Complete information Discrete Mathematics and Combinatorics 0101 mathematics Mathematics |
| Zdroj: | Journal of Combinatorial Theory, Series B. 136:170-192 |
| ISSN: | 0095-8956 |
| DOI: | 10.1016/j.jctb.2018.10.003 |
| Popis: | When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely: when is it that the existence of automorphisms acting as even permutations on the vertex set of a graph, called even automorphisms, forces the existence of automorphisms that act as odd permutations, called odd automorphisms. As a first step towards resolving the above question, complete information on the existence of odd automorphisms in cubic symmetric graphs is given. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect