SECURE VERTEX COVER PEBBLING NUMBER FOR FAMILIES OF TREE-DERIVED STRUCTURES
Keywords:
pebbling, secure vertex cover, secure vertex cover pebbling numberDOI:
https://doi.org/10.17654/0974165825012Abstract
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.
Received: July 27, 2024
Revised: August 15, 2024
Accepted: November 15, 2024
References
F. R. K. Chung, Pebbling in hypercubes, SIAM Journal on Discrete Mathematics 2(4) (1989), 467-472.
G. H. Hurlbert, A survey of graph pebbling, In Congr. Numer. 139 (1999), 41-64.
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.
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.
S. Sarah Surya, Alan Thomas and Lian Mathew, Integer cordial labeling of some families of graphs, Ratio Mathematica 42 (2022), 105-114.
S. Sarah Surya and Lian Mathew, Bound for secure vertex cover pebbling number for hypercube, Proyoccenies Journal of Mathematics, under review.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA

This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Contact Pushpa Publishing House for more info or permissions.
Journal Impact Factor: 