2011/01/27 by B. L. Douglas, Douglas, B. L.
Computer Science · Mathematics · #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Cryptography and Data Security #FOS: Mathematics #Interconnection Networks and Systems #math.CO
paper · pdf · doi:10.48550/arxiv.1101.5211
arxiv created 2011/01/27 · openalex publication_date 2011/01/27 · arxiv updated 2011/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Properties of the `k-equivalent' graph families constructed in Cai, Fürer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive k-dim WL method. An extension to the recursive k-dim WL method is presented that is shown to efficiently characterise all such types of `counterexample' graphs, under certain assumptions. These assumptions are shown to hold in all known cases.