On isomorphism between circulant and Cartesian product of 2 cycles

DOI10.1016/j.dam.2015.05.022zbMath1319.05110OpenAlexW617170108MaRDI QIDQ494437

Zbigniew R. Bogdanowicz

Publication date: 1 September 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.022

zbMATH Keywords

isomorphismcirculant graphCartesian product of cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Isomorphism between circulants and Cartesian products of cycles ⋮ Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants

Cites Work

• Cartesian graph factorization at logarithmic cost per edge
• Isomorphism of circulant graphs and digraphs
• Circulants and their connectivities
• A solution of the isomorphism problem for circulant graphs

This page was built for publication: On isomorphism between circulant and Cartesian product of 2 cycles