### Abstract

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 and we show that Graham's conjecture does not hold for rubbling numbers.

Original language | English (US) |
---|---|

Pages (from-to) | 3436-3446 |

Number of pages | 11 |

Journal | Discrete Mathematics |

Volume | 309 |

Issue number | 10 |

DOIs | |

State | Published - May 28 2009 |

### Fingerprint

### Keywords

- Optimal pebbling
- Pebbling
- Rubbling

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*309*(10), 3436-3446. https://doi.org/10.1016/j.disc.2008.09.035