A pebbling move on a graph consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph , denoted by , is the least such that any distribution of pebbles on allows one pebble to be moved to any specified but arbitrary vertex by a sequence of pebbling moves. This paper determines the pebbling numbers and the 2-pebbling property of the middle graph of fan graphs.
"The 2-Pebbling Property of the Middle Graph of Fan Graphs." J. Appl. Math. 2014 1 - 5, 2014. https://doi.org/10.1155/2014/304514