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

DOI10.26493/1855-3974.362.504MaRDI QIDQ3466845zbMATH OpenOpenAlexWikidataFDO

Authors Edward Dobson, István Kovács, Štefko Miklavič

Publication date 25 January 2016

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.362.504

zbMATH Keywords

automorphism groupisomorphism problemrose window graphsvertex-transitive graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Group actions on combinatorial structures (05E18)

Recommendations

• Classification of edge-transitive rose window graphs
• Rose window graphs
• Classification of Cayley Rose window graphs
• The isomorphism problem for rose window graphs
• Graphs on which a group of prime power order with a cyclic maximal subgroup acts edge-transitively. I

Cited in

(11)

• On certain edge-transitive bicirculants of twice odd order
• Domination in rose window graphs
• On automorphism groups of deleted wreath products
• The isomorphism problem for rose window graphs
• Classification of edge-transitive rose window graphs
• Classification of Cayley Rose window graphs
• Rose window graphs
• Arc‐transitive maps with underlying Rose Window graphs
• Classification of edge-transitive nest graphs
• Stability of Rose Window graphs
• Edge-transitive core-free nest graphs

This page was built for publication: The automorphism groups of non-edge-transitive rose window graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466845)