The secure vertex cover pebbling number of a graph G, is the smallest number m that allows every distribution of m pebbles to reach some secure vertex cover of G by a sequence of pebbling moves. Trees are advantageous in biological science especially in systematics, bioinformatics and phylogenetics. In this paper, the secure vertex cover pebbling number for some tree-derived structures such as coconut tree, comb graph, Bistar graph, Banana tree and complete binary tree has been determined.

pebbling, secure vertex cover, secure vertex cover pebbling number.

Received: July 27, 2024; Revised: August 15, 2024; Accepted: November 15, 2024; Published: December 31, 2024

How to cite this article: S. Sarah Surya, Lian Mathew, Jyothy Thomas and Jeet Kurian Mattam, Secure vertex cover pebbling number for families of tree-derived structures, Advances and Applications in Discrete Mathematics 42(2) (2025), 177-190. https://doi.org/10.17654/0974165825012

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] F. R. K. Chung, Pebbling in hypercubes, SIAM Journal on Discrete Mathematics 2(4) (1989), 467-472.
[2] G. H. Hurlbert, A survey of graph pebbling, In Congr. Numer. 139 (1999), 41-64.
[3] Glenn H. Hurlbert, Lian Mathew, Jasintha Quadras and S. Sarah Surya, On secure vertex cover pebbling number, Asian-European Journal of Mathematics 16(10) (2023), 1-16.
[4] R. Prabha and S. Renuka Devi, General position problem of hyper tree and shuffle hyper tree networks, AIP Conference Proceedings, No. 1. AIP Publishing LLC, 2020.
[5] S. Sarah Surya, Alan Thomas and Lian Mathew, Integer cordial labeling of some families of graphs, Ratio Mathematica 42 (2022), 105-114.
[6] S. Sarah Surya and Lian Mathew, Bound for secure vertex cover pebbling number for hypercube, Proyoccenies Journal of Mathematics, under review.