Publication Date:
2014-07-23
Description:
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.
Print ISSN:
1110-757X
Electronic ISSN:
1687-0042
Topics:
Mathematics
Permalink