- Tytuł:
- 1-Restricted Optimal Rubbling on Graphs
- Autorzy:
-
Beeler, Robert A.
Haynes, Teresa W.
Murphy, Kyle - Powiązania:
- https://bibliotekanauki.pl/articles/31343383.pdf
- Data publikacji:
- 2019-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph pebbling
graph rubbling
optimal rubbling
t -restricted optimal pebbling - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 575-588
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł