On isomorphism between circulant and Cartesian product of 2 cycles

DOI10.1016/J.DAM.2015.05.022MaRDI QIDQ494437zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(2)

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

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

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