The pebbling number of thorn graphs
Keywords:
Graphs, Pebbling number, thorn graph, thorn star .Abstract
Given a distribution of pebbles on the vertices of a connected graph G, the pebbling number of a graph G, is the least number f(G) such that no matter how these f(G) pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of pebbling moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex.
References
F.R.K. Chung, Pebbling in hypercubes, SIAM J. Disc. Math., 2 (4), pp. 467-472, (1989).[2] A. Kirlangic (2004): The scattering number of thorn graphs, Int. J. Comput. Math.,Vol. 82, pp. 299-311.
Downloads
Published
2024-09-23
How to Cite
C. Muthulakshmi, A. Arul Steffi. (2024). The pebbling number of thorn graphs. Journal of Computational Analysis and Applications (JoCAAA), 33(06), 1393–1399. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1949
Issue
Section
Articles
