Name
Abstract | ||
|---|---|---|
A pebbling move on a graph G consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph G, denoted by f(G), is the least n such that any distribution of n pebbles on G 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2012.07.013 | Discrete Mathematics |
Keywords | Field | DocType |
Pebble,Odd cycles,Pebbling number | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Neighbourhood (graph theory),Pebble,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
312 | 21 | 0012-365X |
Citations | PageRank | References |
2 | 0.52 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongsheng Ye | 1 | 4 | 1.38 |
| Mingqing Zhai | 2 | 18 | 6.26 |
| Y. Zhang | 3 | 288 | 39.66 |