The Weisfeiler-Leman Algorithm and Recognition of Graph Properties

The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a very useful combinatorial tool in graph isomorphism testing. We address the applicability of $k$-WL to recognition of graph properties. Let $G$ be an input graph with $n$ vertices. We show that, if $n$ is prime, then vertex-transitivity of $G$ can be seen in a straightforward way from the output of 2-WL on $G$ and on the vertex-individualized copies of $G$. However, if $n$ is divisible by 16, then $k$-WL is unable to distinguish between vertex-transitive and non-vertex-transitive graphs with $n$ vertices as long as $k=o(\sqrt n)$. Similar results are obtained for recognition of arc-transitivity.

[1]  László Babai,et al.  Local expansion of vertex-transitive graphs and random generation in finite groups , 1991, STOC '91.

[2]  Helmut Veith,et al.  The first order definability of graphs: Upper bounds for quantifier depth , 2006, Discret. Appl. Math..

[3]  Martin Grohe,et al.  Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[4]  M. Klin,et al.  The isomorphism problem for circulant graphs via Schur ring theory , 1999, Codes and Association Schemes.

[5]  M. Klin,et al.  Cellular Rings and Groups of Automorphisms of Graphs , 1994 .

[6]  WERNER BALLMANN.  AUTOMORPHISM GROUPS , 2011 .

[7]  Martin Fürer,et al.  On the Combinatorial Power of the Weisfeiler-Lehman Algorithm , 2017, CIAC.

[8]  L. Babai.  Automorphism groups, isomorphism, reconstruction , 1996 .

[9]  László Babai,et al.  On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..

[10]  Xi Chen,et al.  Faster Canonical Forms for Strongly Regular Graphs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[11]  Á. Tóth.  Roots of quadratic congruences , 2000 .

[12]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[13]  Willem H. Haemers,et al.  Spectra of Graphs , 2011 .

[14]  Christian Pech.  On highly regular strongly regular graphs , 2021, Algebraic Combinatorics.

[15]  James Turner.  Point-symmetric graphs with a prime number of points , 1967 .

[16]  Daniel Neuen,et al.  Benchmark Graphs for Practical Graph Isomorphism , 2017, ESA.

[17]  A. A. LEMAN,et al.  THE REDUCTION OF A GRAPH TO CANONICAL FORM AND THE ALGEBRA WHICH APPEARS THEREIN , 2018 .

[18]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[19]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[20]  Brian Alspach,et al.  VERTEX‐TRANSITIVE GRAPHS OF ORDER 2p , 1979 .

[21]  M. Watkins.  Connectivity of transitive graphs , 1970 .

[22]  Pascal Schweitzer,et al.  The Weisfeiler-Leman dimension of planar graphs is at most 3 , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[23]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[24]  Sven Reichard,et al.  A Criterion for the t-Vertex Condition of Graphs , 2000, J. Comb. Theory, Ser. A.

[25]  Peter J. Cameron,et al.  Designs, graphs, codes, and their links , 1991 .

[26]  Yan-Quan Feng,et al.  Constructing an Infinite Family of Cubic 1-Regular Graphs , 2002, Eur. J. Comb..

[27]  Patrick Chiu,et al.  Cubic Ramanujan graphs , 1992, Comb..

[28]  Gottfried Tinhofer,et al.  Forestal algebras and algebraic forests (on a new class of weakly compact graphs) , 2000, Discret. Math..

[29]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[30]  Mikhail E. Muzychuk,et al.  On pseudocyclic association schemes , 2009, Ars Math. Contemp..

[31]  Ying Cheng,et al.  On weakly symmetric graphs of order twice a prime , 1987, J. Comb. Theory, Ser. B.

[32]  B. Alspach.  Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree☆ , 1973 .

[33]  Oleg Verbitsky,et al.  Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm , 2019, STACS.

[34]  Peter J. Cameron,et al.  6-Transitive graphs , 1980, J. Comb. Theory, Ser. B.

[35]  D. G. Higman.  Characterization of families of rank 3 permutation groups by the subdegrees II , 1970 .

[36]  D. G. Higman.  Coherent configurations , 1975 .

[37]  A. Gardiner.  Homogeneity conditions in graphs , 1978, J. Comb. Theory, Ser. B.

[38]  Sergei Evdokimov,et al.  On Highly Closed Cellular Algebras and Highly Closed Isomorphisms , 1998, Electron. J. Comb..

[39]  László Babai,et al.  Graph isomorphism in quasipolynomial time [extended abstract] , 2015, STOC.

[40]  Mikhail E. Muzychuk,et al.  Recognizing Circulant Graphs of Prime Order in Polynomial Time , 1998, Electron. J. Comb..

[41]  Donald G. Higman.  Characterization of families of rank 3 permutation groups by the subdegrees I , 1970 .

[42]  László Babai,et al.  Isomorphism problem for a class of point-symmetric structures , 1977 .

[43]  S. Evdokimov,et al.  Circulant graphs: recognizing and isomorphism testing in polynomial time , 2004 .