Pebbling Number and the 2-pebbling Property of the Thorn Graph of C_5
Jian-Hua Yin · Hainan Daxue xuebao. Ziran kexue ban · 2011
The pebbling number of a connected graph G is the smallest number f(G),and that any distribution of f(G) pebbles on G allows one pebble to be moved to any specified but arbitrary vertex by a sequence of pebbling moves.A pebbling move on a graph G is to be removal of two pebbles from one vertex and then the addition of one pebble to some adjacent vertex.In our report,the pebbling number of the thorn graph of C5 was determined,and the property that the thorn graph of C5 has the 2-pebbling was testified.