Canonization of a random circulant graph by counting walks
From MaRDI portal
Publication:6575405
Cites work
- scientific article; zbMATH DE number 5509797 (Why is no real title available?)
- scientific article; zbMATH DE number 1185220 (Why is no real title available?)
- scientific article; zbMATH DE number 612882 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- A solution of the isomorphism problem for circulant graphs
- An optimal lower bound on the number of variables for graph identification
- Cayley graphs on abelian groups
- Circulant graphs: recognizing and isomorphism testing in polynomial time
- Controllable subsets in graphs
- Distinguishing Vertices of Random Graphs
- Isomorphism problem for a class of point-symmetric structures
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- On the automorphism groups of almost all circulant graphs and digraphs
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- Practical graph isomorphism. II.
- Random Graph Isomorphism
- Random circulant matrices
- Some results on graph spectra
- Some results on random circulant matrices
- Symmetry in Graphs
- The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
- The Weisfeiler-Leman algorithm and recognition of graph properties
- The isomorphism problem for circulant graphs via Schur ring theory
- The walk partition and colorations of a graph
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Unlocking the walk matrix of a graph
This page was built for publication: Canonization of a random circulant graph by counting walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575405)
