Distance 2-restricted optimal pebbling in cycles
Let $ G $ be a graph and let $ \delta $ be a distribution of pebbles on $ G $. A pebbling move on the graph $ G $ consists of removing two pebbles from one vertex and then placing one pebble at an adjacent vertex. Given a positive integer $ d $, if we can move pebbles to any target vertex $ v $ in $...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2025-02-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2025201 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|