Open Access
Translator Disclaimer
2014 The 2-Pebbling Property of the Middle Graph of Fan Graphs
Yongsheng Ye, Fang Liu, Caixia Shi
J. Appl. Math. 2014: 1-5 (2014). DOI: 10.1155/2014/304514


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 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.


Download Citation

Yongsheng Ye. Fang Liu. Caixia Shi. "The 2-Pebbling Property of the Middle Graph of Fan Graphs." J. Appl. Math. 2014 1 - 5, 2014.


Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131500
MathSciNet: MR3246409
Digital Object Identifier: 10.1155/2014/304514

Rights: Copyright © 2014 Hindawi


Vol.2014 • 2014
Back to Top