Liu–Siemons conjecture on walk-matrix equivalence
For any two graphs and of order , with adjacency matrices and , let be the all-one vector and define and . The Liu–Siemons conjecture asserts that implies that and are isomorphic.
References
Primary source
Additional references
- A Characterization of Walk-Matrix Equivalence at Corank Two via Reciprocal WQH Switching — arXiv — Chaochao Zhu, Qin Yue
Progress summary
A new unrefereed preprint claims the conjecture is false and gives counterexamples in every sufficiently large size, but the claim has not been independently checked.
The Liu–Siemons conjecture concerns when graphs with equivalent walk matrices must be structurally equivalent. Chaochao Zhu and Qin Yue claim a complete disproof and replacement by a switching classification.
Known results
- If a graph’s walk matrix has rank at least , its adjacency matrix is determined by that walk matrix; in this range, equality corresponds to graph isomorphism.
Recent preprint
Chaochao Zhu and Qin Yue claim a complete characterization at corank two via reciprocal WQH switching, no examples through order , and connected counterexamples for every . The source is an unrefereed preprint, so this disproof and classification remain unverified.
Current status (as of September 2026): The conjecture is claimed false, with a claimed structural classification and connected examples for every , but the preprint’s results remain unverified.
Solutions 0
No solutions have been posted yet.