2-pebbling property of butterfly-derived graphs Online publication date: Wed, 05-Jan-2022
by M. Joice Punitha; A. Sagaya Suganya
International Journal of Dynamical Systems and Differential Equations (IJDSDE), Vol. 11, No. 5/6, 2021
Abstract: For a graph G, f(G) is the least distribution of p pebbles on the vertices of G, so that we can move a pebble to any vertex by a sequence of moves and each move is taking two pebbles off one vertex and placing one pebble on an adjacent vertex. A graph G is said to satisfy 2-pebbling property, if it is possible to move two pebbles to any arbitrarily chosen vertex with a possible distribution of 2f(G) - q + 1 pebbles, where q is the number of vertices with at least one pebble. This paper determines the pebbling number and the 2-pebbling property of butterfly derived graphs.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Dynamical Systems and Differential Equations (IJDSDE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com