1 paper
Dongxiu Cai, Zhenbo Chen, Jiasheng Zeng +1
For a finite simple graph G and an integer k≥0, let wk(G) denote the number of walks of length k. We prove the conjecture of Täubig, Weihmann, Kosub, Hemmecke, and Mayr…