Name
Abstract | ||
|---|---|---|
For a graph G=(V,E), we consider placing a variable number of pebbles on the vertices of V. A pebbling move consists of deleting two pebbles from a vertex u∈V and placing one pebble on a vertex v adjacent to u. We seek an initial placement of a minimum total number of pebbles on the vertices in V, so that no vertex receives more than some positive integer t pebbles and for any given vertex v∈V, it is possible, by a sequence of pebbling moves, to move at least one pebble to v. We relate this minimum number of pebbles to several other well-studied parameters of a graph G, including the domination number, the optimal pebbling number, and the Roman domination number of G. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2016.12.029 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Domination,Roman domination,Optimal pebbling number,Pebbling number | Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Pebble,Domination analysis,Mathematics | Journal |
Volume | ISSN | Citations |
221 | 0166-218X | 1 |
PageRank | References | Authors |
0.63 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mustapha Chellali | 1 | 188 | 38.24 |
| Teresa W. Haynes | 2 | 774 | 94.22 |
| Stephen T. Hedetniemi | 3 | 1575 | 289.01 |
| Thomas M. Lewis | 4 | 3 | 1.70 |