The automorphism groups of non-edge-transitive rose window graphs
Dobson, Ted ; Kovács, István ; Miklavič, Štefko
ARS MATHEMATICA CONTEMPORANEA, Tome 9 (2014), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

In this paper, we will 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 will 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.

Publié le : 2014-01-01
DOI : https://doi.org/10.26493/1855-3974.362.504 
@article{362,
     title = {The automorphism groups of non-edge-transitive rose window graphs},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {9},
     year = {2014},
     doi = {10.26493/1855-3974.362.504},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/362}
}

Dobson, Ted; Kovács, István; Miklavič, Štefko. The automorphism groups of non-edge-transitive rose window graphs. ARS MATHEMATICA CONTEMPORANEA, Tome 9 (2014) . doi : 10.26493/1855-3974.362.504. http://gdmltest.u-ga.fr/item/362/