1-Restricted Optimal Rubbling on Graphs
Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 2, pp. 575-588
Voir la notice de l'article provenant de la source Library of Science
Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from each of two neighbors of a vertex v and placing a pebble on v. We seek an initial placement of a minimum total number of pebbles on the vertices in V, so that no vertex receives more than one pebble and for any given vertex v ∈ V, it is possible, by a sequence of pebbling and rubbling moves, to move at least one pebble to v. This minimum number of pebbles is the 1-restricted optimal rubbling number. We determine the 1-restricted optimal rubbling numbers for Cartesian products. We also present bounds on the 1-restricted optimal rubbling number.
Keywords:
graph pebbling, graph rubbling, optimal rubbling, t -restricted optimal pebbling
@article{DMGT_2019_39_2_a19,
author = {Beeler, Robert A. and Haynes, Teresa W. and Murphy, Kyle},
title = {1-Restricted {Optimal} {Rubbling} on {Graphs}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {575--588},
publisher = {mathdoc},
volume = {39},
number = {2},
year = {2019},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2019_39_2_a19/}
}
TY - JOUR AU - Beeler, Robert A. AU - Haynes, Teresa W. AU - Murphy, Kyle TI - 1-Restricted Optimal Rubbling on Graphs JO - Discussiones Mathematicae. Graph Theory PY - 2019 SP - 575 EP - 588 VL - 39 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2019_39_2_a19/ LA - en ID - DMGT_2019_39_2_a19 ER -
Beeler, Robert A.; Haynes, Teresa W.; Murphy, Kyle. 1-Restricted Optimal Rubbling on Graphs. Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 2, pp. 575-588. http://geodesic.mathdoc.fr/item/DMGT_2019_39_2_a19/