A pr 2 00 8 Graph pegging numbers

@inproceedings{Helleloid2005AP2,
  title={A pr 2 00 8 Graph pegging numbers},
  author={Geir T. Helleloid and Madeeha Khalid and David Petrie Moulton and Philip Matchett Wood},
  year={2005}
}
In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like “pegging moves” allowed. Motivated by well-studied questions in graph pebbling, we introduce two pegging quantities. The pegging number (respectively, the optimal pegging number) of a graph is the minimum number of pegs such that for every (respectively, some) distribution of that many pegs on the graph, any vertex can be reached by a sequence of pegging moves. We prove several basic… CONTINUE READING