Rubbling and optimal rubbling of graphs

Christopher Belford, Nandor Sieben

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)3436-3446
Number of pages11
JournalDiscrete Mathematics
Volume309
Issue number10
DOIs
StatePublished - May 28 2009

Fingerprint

Graph in graph theory
Vertex of a graph
Adjacent

Keywords

  • Optimal pebbling
  • Pebbling
  • Rubbling

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Rubbling and optimal rubbling of graphs. / Belford, Christopher; Sieben, Nandor.

In: Discrete Mathematics, Vol. 309, No. 10, 28.05.2009, p. 3436-3446.

Research output: Contribution to journalArticle

Belford, Christopher ; Sieben, Nandor. / Rubbling and optimal rubbling of graphs. In: Discrete Mathematics. 2009 ; Vol. 309, No. 10. pp. 3436-3446.
@article{ec77cddd71424c94a575e52b73ee2d05,
title = "Rubbling and optimal rubbling of graphs",
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.",
keywords = "Optimal pebbling, Pebbling, Rubbling",
author = "Christopher Belford and Nandor Sieben",
year = "2009",
month = "5",
day = "28",
doi = "10.1016/j.disc.2008.09.035",
language = "English (US)",
volume = "309",
pages = "3436--3446",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

T1 - Rubbling and optimal rubbling of graphs

AU - Belford, Christopher

AU - Sieben, Nandor

PY - 2009/5/28

Y1 - 2009/5/28

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

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

KW - Optimal pebbling

KW - Pebbling

KW - Rubbling

UR - http://www.scopus.com/inward/record.url?scp=67349112995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67349112995&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2008.09.035

DO - 10.1016/j.disc.2008.09.035

M3 - Article

VL - 309

SP - 3436

EP - 3446

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 10

ER -