CF Pebbling Number of Path and Path Related Graphs

Abstract

Assume G is a graph with some pebbles distributed over its vertices. A CF pebbling move is when x pebbles are removed from one vertex,  pebbles are thrown away and   pebbles are moved to an adjacent vertex. The CF pebbling number λ(G), of a connected graph G is the least positive integer n such that any distribution of n pebbles on G, allows one pebble to be carried to any arbitrary vertex using a sequence of CF pebbling moves. The CF pebbling number of path and path related graphs are determined in this study.