The optimal pebbling of spindle graphs
Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The optimal pebbling number of G, denoted by πopt(G), is the smallest number m such that for some distribution of m pebble...
| Prif Awduron: | , |
|---|---|
| Fformat: | Erthygl |
| Iaith: | English |
| Cyhoeddwyd: |
De Gruyter
2019-11-01
|
| Cyfres: | Open Mathematics |
| Pynciau: | |
| Mynediad Ar-lein: | https://doi.org/10.1515/math-2019-0094 |