Graph pegging numbers

Simple item page
dc.creatorHelleloid, Geir
dc.creatorKhalid, Madeeha
dc.creatorMoulton, David Petrie
dc.creatorWood, Philip Matchett
dc.date2008-04-07
dc.date.accessioned2026-07-07T09:30:51Z
dc.date.available2026-07-07T09:30:51Z
dc.descriptionIn 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 properties of pegging and analyze the pegging number and optimal pegging number of several classes of graphs, including paths, cycles, products with complete graphs, hypercubes, and graphs of small diameter.
dc.description26 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/0804.1095
dc.identifierhttp://arxiv.org/abs/0804.1095
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158257
dc.subjectCombinatorics
dc.subject05C35
dc.titleGraph pegging numbers
dc.typetext

Files

Collections

arXiv