6 citations · 6 across the 1 of their papers we have counts for
1 paper
Anant Godbole, Debra Knisley, Rick Norwood
Consider a graph G = G(k,d,s) with vertex set the set of all k-letter words over an alphabet of size d. An edge e = vw is in E iff v is distinct from w and the last(first) k-s lett…