2 papers
math.CO2023
Non-split Domination Cover Pebbling Number for Some Class of Middle Graphs
A. Lourdusamy, I. Dhivviyanandam, Lian Mathew
Let be a connected graph. A pebbling move is defined as taking two pebbles from one vertex and placing one pebble to an adjacent vertex and throwing away the other pebble. The…
math.CO2022
On the Secure Vertex Cover Pebbling Number
Glenn H Hurlbert, Lian Mathew, Jasintha Quadras +1
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 intro…