Classification of Cayley Rose window graphs

DOI10.20429/TAG.2021.080107MaRDI QIDQ3380400zbMATH OpenOpenAlexFDO

Authors Angsuman Das, Arnab Mandal

Publication date 28 September 2021

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1907.03751

zbMATH Keywords

Cayley graphgraph embeddings into surface

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Group actions on combinatorial structures (05E18)

Abstract: Rose window graphs are a family of tetravalent graphs, introduced by Steve Wilson. Following it, Kovacs, Kutnar and Marusic classified the edge-transitive rose window graphs and Dobson, Kovacs and Miklavic characterized the vertex transitive rose window graphs. In this paper, we classify the Cayley rose window graphs.

Recommendations

• Classification of edge-transitive rose window graphs
• Rose window graphs
• Rose window graphs underlying rotary maps
• The isomorphism problem for rose window graphs
• The automorphism groups of non-edge-transitive rose window graphs

Cited in

(7)

• The isomorphism problem for rose window graphs
• Classification of edge-transitive rose window graphs
• The automorphism groups of non-edge-transitive rose window graphs
• Rose window graphs
• Arc‐transitive maps with underlying Rose Window graphs
• Classification of Ryser graphs
• Rose window graphs underlying rotary maps

This page was built for publication: Classification of Cayley Rose window graphs

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