Graph pegging numbers

Details Graph pegging numbers Graph pegging numbers

2008-04-07

arxiv.org/abs/0804.1095v1

Mathematics

Combinatorics

26 pages, 3 figures

Scientific paper

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 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.

Affiliated with

Also associated with

No associations

Rating

Graph pegging numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph pegging numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph pegging numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729977