The automorphism groups of non-edge-transitive rose window graphs

被引:0
|
作者
Dobson, Edward [1 ]
Kovacs, Istvan [2 ,3 ]
Miklavic, Stefko [2 ,3 ]
机构
[1] Mississippi State Univ, Dept Math & Stat, Mississippi State, MS 39762 USA
[2] Univ Primorska, UP IAM, Koper 6000, Slovenia
[3] Univ Primorska, UP FAMNIT, Koper 6000, Slovenia
关键词
Rose window graphs; automorphism group; isomorphism problem; vertex-transitive graph; GENERALIZED PETERSEN GRAPHS; I-GRAPHS;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:63 / 75
页数:13
相关论文
共 50 条