The 2-Pebbling Property of the Middle Graph of Fan Graphs
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 but arbitra...
Main Authors: | Yongsheng Ye, Fang Liu, Caixia Shi |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/304514 |
Similar Items
-
The Foundations of Graph Pebbling
by: Bounadi, Monir
Published: (2015) -
Extensions of Graph Pebbling
by: Yerger, Carl
Published: (2005) -
Optimally t-Pebbling Graphs
by: Hung-Hsing Chiang, et al.
Published: (2018) -
Optimally Pebbling Graphs
by: Chin-Lin Shiue, et al. -
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
by: Demaine, Erik D, et al.
Published: (2019)