Universal determinant formula conjecture for adjacency walk matrices of rooted-product preservers
Let be an -preserver of order , and let be any graph. Write for the adjacency matrix of , for its adjacency walk matrix, and for the rooted product. Universal determinant formula conjecture. One has
This conjecture is motivated by an exhaustive search for -preservers of order at most , where all listed preservers exhibited this form. A general proof is not supplied and remains open.
References
Primary source
Wei Wang, Jie Shen and Lihuan Mao, “A general formula for walk determinants of rooted products with applications to DGS-graph constructions”, arXiv:2601.01542 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.