Combinatorial refinement on circulant graphs

DOI10.1007/s00037-024-00255-2zbMATH Open1546.05103MaRDI QIDQ6599766

Laurence Kluge

Publication date: 6 September 2024

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

Schur modulesCayley graphscirculant graphsWeisfeiler-Leman algorithmcolor refinement

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on certain subpolytopes of the assignment polytope associated with circulant graphs
• Partitioning a graph in \(O(|A|\log_ 2|V|)\)
• A note on compact graphs
• An optimal lower bound on the number of variables for graph identification
• Chebotarëv and his density theorem
• Graph isomorphism, color refinement, and compactness
• Permutation groups of prime degree, a quick proof of Burnside's theorem.
• On pseudofrobenius imprimitive association schemes
• Logical complexity of graphs: a survey
• Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
• Testing Graph Isomorphism in Parallel by Playing a Game
• A solution of the isomorphism problem for circulant graphs
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Automorphisms of the Complex Numbers

This page was built for publication: Combinatorial refinement on circulant graphs