The isomorphism problem for rose window graphs
From MaRDI portal
Publication:2439119
DOI10.1016/j.disc.2014.01.001zbMath1283.05184MaRDI 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
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Maximum matchings of a digraph based on the largest geometric multiplicity, A time-based solution for the graph isomorphism problem, Domination in rose window graphs
Uses Software
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