Canonization of a random circulant graph by counting walks

DOI10.1007/978-981-97-0566-5_23MaRDI QIDQ6575405

M. E. Zhukovskii, Oleg Verbitsky

Publication date: 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning a graph in \(O(|A|\log_ 2|V|)\)
• The walk partition and colorations of a graph
• An optimal lower bound on the number of variables for graph identification
• Cayley graphs on abelian groups
• Some results on graph spectra
• Controllable subsets in graphs
• Unlocking the walk matrix of a graph
• Tight lower and upper bounds for the complexity of canonical colour refinement
• Practical graph isomorphism. II.
• Some results on random circulant matrices
• On the automorphism groups of almost all circulant graphs and digraphs
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• Random Graph Isomorphism
• Distinguishing Vertices of Random Graphs
• Isomorphism problem for a class of point-symmetric structures
• A solution of the isomorphism problem for circulant graphs
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Symmetry in Graphs
• The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
• The Weisfeiler-Leman algorithm and recognition of graph properties

This page was built for publication: Canonization of a random circulant graph by counting walks