SECURE VERTEX COVER PEBBLING NUMBER FOR FAMILIES OF TREE-DERIVED STRUCTURES
S. Sarah Surya, Lian Mathew, Jyothy Thomas, Jeet Kurian Mattam · Advances and Applications in Discrete Mathematics · 2024
The secure vertex cover pebbling number of a graph , is the smallest number that allows every distribution of pebbles to reach some secure vertex cover of 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.