The 2-Pebbling Property of the Middle Graph of Fan Graphs

[摘要] A pebbling move on a graphGconsists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graphG, denoted byf(G), is the leastnsuch that any distribution ofnpebbles onGallows 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.

[学科分类] 应用数学