• THE PEBBLING NUMBER OF UNIWHEEL GRAPHS
Abstract
In a graph G with a distribution of pebbles on its vertices, a pebbling move is the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number, f(G), of a graph G is the least number m such that, however m pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of pebbling moves. In this paper, we determine f(G) for uniwheel graphs.
Keywords
Pebbling, Helm graph, wheel lollipop.
Full Text:
pdfThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |