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

DOI10.26493/1855-3974.362.504zbMath1329.05213OpenAlexW1636588825WikidataQ129355145 ScholiaQ129355145MaRDI QIDQ3466845

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

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 problemvertex-transitive graphrose window graphs

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)

Related Items (5)

On certain edge-transitive bicirculants of twice odd order ⋮ Arc‐transitive maps with underlying Rose Window graphs ⋮ Classification of edge-transitive nest graphs ⋮ Domination in rose window graphs ⋮ On automorphism groups of deleted wreath products

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