Abstract
A new graph invariant called the secure vertex cover pebbling number, which is a combination of two graph invariants, namely, ‘secure vertex cover’ and ‘cover pebbling number’, is introduced in this paper. The secure vertex cover pebbling number of a graph, [Formula: see text], is the minimum number [Formula: see text] so that every distribution of [Formula: see text] pebbles can reach some secure vertex cover of [Formula: see text] by a sequence of pebbling moves. In this paper, the complexity of the secure vertex cover problem and secure vertex cover pebbling problem are discussed. Also, we obtain some basic results and the secure vertex cover pebbling number for complete [Formula: see text]-partite graphs, paths, Friendship graphs, and wheel graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
