The t-pebbling number and 2t-pebbling property of rooted product of some graphs
Congressus Numerantium · 2025
DOI: 10.61091/cn236-03 ↗Kurz gefasst
Fachartikel in der Zeitschrift Congressus Numerantium, 2025. Verfasst von Sagaya Suganya A und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Graph pebbling is a network optimization method modeling the movement of resources in transit. A pebbling move on a connected graph \(G\) removes two pebbles from a vertex, places one on an adjacent vertex, and discards the other, with the loss analogous to packet loss in communication networks. The generalized version, \(t\)-pebbling, defines the \(t\)-pebbling number \(f_t(G)\) as the smallest integer such that, from any distribution of \(f_t(G)\) pebbles, \(t\) pebbles can be moved to any vertex \(v\) via a pebbling sequence. A graph satisfies the \(2t\)-pebbling property if \(2t\) pebbles can be transferred to \(v\) when \(2f_t(G)-q+1\) pebbles are distributed, where \(q\) is the number of occupied vertices. This paper establishes a lower bound for the rooted product of two graphs \(G\) and \(H\), sharp when one factor is a path, complete graph, or star. Further results on pebbling in triangle-free graphs are also obtained, including verification of the \(2t\)-pebbling property for rooted products involving such graphs.
Zitieren
APA
A, S. S., M, J. P., & I, D. (2025). The t-pebbling number and 2t-pebbling property of rooted product of some graphs. Congressus Numerantium. https://doi.org/10.61091/cn236-03
Vancouver
A SS, M JP, I D. The t-pebbling number and 2t-pebbling property of rooted product of some graphs. Congressus Numerantium. 2025. doi:10.61091/cn236-03
BibTeX
@article{A2025,
author = {A, Sagaya Suganya and M, Joice Punitha and I, Dhivviyanandam},
title = {The t-pebbling number and 2t-pebbling property of rooted product of some graphs},
journal = {Congressus Numerantium},
year = {2025},
doi = {10.61091/cn236-03}
}
EUVIMED