1. |
2. |
3. |
4. |
5. |
6. |
7. |
8. The automorphism groups of non-edge transitive rose window graphsEdward Dobson, István Kovács, Štefko Miklavič, 2015, original scientific article Abstract: In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs. Keywords: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph Published in RUP: 30.12.2021; Views: 1233; Downloads: 22 Full text (275,74 KB) |
9. |
10. |