The Optimal Rubbling Number of Paths, Cycles, and Grids
A pebbling move on a graph G consists of the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed, which is also called the strict rubbling move. In this new move, one pebble each is remove...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/5545080 |