The automorphism groups of non-edge transitive rose window graphsDobson, Edward Tauscher (Avtor) Kovács, István (Avtor) Miklavič, Štefko (Avtor) rose window graphsautomorphism groupisomorphism problemvertex-transitive graphIn 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.20152021-12-31 00:53:10Neznano17614UDK: 519.17ISSN pri članku: 1855-3966COBISS.SI-ID: 1536920004sl