| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648011 | Discrete Mathematics | 2012 | 5 Pages |
Abstract
A pebbling move on a graph GG consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph GG, denoted by f(G)f(G), is the least nn such that any distribution of nn pebbles on GG allows one pebble to be moved to any specified vertex by a sequence of pebbling moves. This paper determines the pebbling numbers of squares of odd cycles.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yongsheng Ye, Mingqing Zhai, Yun Zhang,