Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs
| Autor: | Mariusz Grech, Andrzej Kisielewicz |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Group (mathematics)
Applied Mathematics Colored graph 010102 general mathematics Complete graph 0102 computer and information sciences Permutation group Edge (geometry) Automorphism 01 natural sciences Combinatorics Mathematics::Group Theory Colored 010201 computation theory & mathematics Simple (abstract algebra) Discrete Mathematics and Combinatorics 0101 mathematics Mathematics |
| Zdroj: | Electronic Notes in Discrete Mathematics. 68:41-46 |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2018.06.008 |
| Popis: | In this paper we describe the automorphism groups of graphs and edge-colored graphs that are cyclic as permutation groups. In addition, we show that every such group is the automorphism group of a complete graph whose edges are colored with 3 colors, and we characterize those groups that are automorphism groups of simple graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect