The Pi-Pebbling Function
| dc.creator | Arnold, T. Ballie | |
| dc.date | 2005-06-22 | |
| dc.date.accessioned | 2026-07-07T05:20:54Z | |
| dc.date.available | 2026-07-07T05:20:54Z | |
| dc.description | Recent research in graph pebbling has introduced the notion of a cover pebbling number. Along this same idea, we develop a more general pebbling function Pi(G, t, P). This measures the minimum number of pebbles needed to guarantee that any distribution of them on G can be transformed via pebbling moves to a distribution with pebbles on t target vertices. Furthermore, the P part of the function gives the ability to change how many pebbles are needed to pebble from one vertex to another. Bounds on the Pi-pebbling function are developed, as well as its exact value for several families of graphs. | |
| dc.description | 10 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/math/0506438 | |
| dc.identifier | http://arxiv.org/abs/math/0506438 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/75550 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C99; 05C35 | |
| dc.title | The Pi-Pebbling Function | |
| dc.type | text |