7 citations · 7 across the 6 of their papers we have counts for
1 paper · 1 filter
Nadja Willenborg, Sven Kosub
Let wm(G) denote the total number of walks of length m in an undirected graph G. Spectral decomposition shows that (wm(G))m≥0 is a moment sequence of a finite posit…