11 citations · 17 across the 2 of their papers we have counts for
2 papers
math.CO2005★ 6 cited
Some Properties of Alphabet Overlap Graphs
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…
math.CO2005★ 11 cited
Domination Cover Pebbling: Graph Families
James Gardner, Anant P. Godbole, Alberto Mokak Teguia +3
Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of thes…