The isomorphism problem for rose window graphs

DOI10.1016/j.disc.2014.01.001zbMath1283.05184OpenAlexW1967686955MaRDI QIDQ2439119

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

Publication date: 7 March 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.01.001

zbMATH Keywords

graph isomorphismrose window graphbicirculants

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

A time-based solution for the graph isomorphism problem ⋮ Domination in rose window graphs ⋮ Maximum matchings of a digraph based on the largest geometric multiplicity

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• On strongly regular bicirculants
• Rose window graphs underlying rotary maps
• On the isomorphism problem for cyclic combinatorial objects
• The Magma algebra system. I: The user language
• On isomorphisms of finite Cayley graphs---a survey
• Characterization of edge-transitive 4-valent bicirculants
• Classification of edge-transitive rose window graphs
• Rose window graphs
• Isomorphism problem for a class of point-symmetric structures
• I-graphs and the corresponding configurations

This page was built for publication: The isomorphism problem for rose window graphs