Rubbling and Optimal Rubbling of Graphs

Details Rubbling and Optimal Rubbling of Graphs Rubbling and Optimal Rubbling of Graphs

2007-07-28

arxiv.org/abs/0707.4256v1

Mathematics

Combinatorics

14 pages

Scientific paper

A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move one pebble is removed at vertices v and w adjacent to a vertex u and an extra pebble is added at vertex u. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using rubbling moves. The rubbling number of a graph is the smallest number m needed to guarantee that any vertex is reachable from any pebble distribution of m pebbles. The optimal rubbling number is the smallest number m needed to guarantee a pebble distribution of m pebbles from which any vertex is reachable. We determine the rubbling and optimal rubbling number of some families of graphs including cycles.

Affiliated with

Also associated with

No associations

Rating

Rubbling and Optimal Rubbling of Graphs 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 Rubbling and Optimal Rubbling of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rubbling and Optimal Rubbling of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-396191