Testing isomorphism of circulant objects in polynomial time

MaRDI QIDQ6621250

M. E. Muzychuk, I. N. Ponomarenko

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmisomorphism problemcyclic combinatorial objects

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• On the isomorphism problem for cyclic combinatorial objects
• Multipliers and generalized multipliers of cyclic objects and cyclic codes
• Isomorphism problem for relational structures with a cyclic automorphism
• The equivalence of two cyclic objects on \(pq\) elements
• Cyclic groups are CI-groups for balanced configurations
• A solution of an equivalence problem for semisimple cyclic codes
• Isomorphism of graphs which are pairwise k-separable
• Isomorphism problem for a class of point-symmetric structures
• A solution of the isomorphism problem for circulant graphs

This page was built for publication: Testing isomorphism of circulant objects in polynomial time

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