Isomorphism between circulants and Cartesian products of cycles

DOI10.1016/J.DAM.2017.04.003MaRDI QIDQ2357772zbMATH OpenOpenAlexFDO

Authors Zbigniew R. Bogdanowicz

Publication date 14 June 2017

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

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

zbMATH Keywords

Cartesian product of cyclescirculant digraphcirculant graphgraph isomorphismP problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Isomorphism testing for circulant graphs C_n (a, b)
• A solution of the isomorphism problem for circulant graphs
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Publication:3197857
• PRODUCTS OF CIRCULANT GRAPHS

Cites work

• A solution of the isomorphism problem for circulant graphs
• Cartesian graph factorization at logarithmic cost per edge
• Circulants and their connectivities
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• Isomorphism of circulant graphs and digraphs
• On isomorphism between circulant and Cartesian product of 2 cycles

Cited in

(5)

• The general position number of Cartesian products involving a factor with small diameter
• PRODUCTS OF CIRCULANT GRAPHS
• Hyper-Hamiltonian circulants
• Isomorphisms of cyclic combinatorial objects
• Neighborhood balanced colorings of graphs

This page was built for publication: Isomorphism between circulants and Cartesian products of cycles

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