| সংক্ষিপ্ত: | Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The optimal pebbling number of G, denoted by πopt(G), is the smallest number m such that for some distribution of m pebbles on G, one pebble can be moved to any vertex of G by a sequence of pebbling moves. Let Pk be the path on k vertices. Snevily defined the n–k spindle graph as follows: take n copies of Pk and two extra vertices x and y, and then join the left endpoint (respectively, the right endpoint) of each Pk to x (respectively, y), the resulting graph is denoted by S(n, k), and called the n–k spindle graph. In this paper, we determine the optimal pebbling number for spindle graphs.
|
|---|