Non-split Domination Cover Pebbling Number for Some Class of Middle Graphs

A. Lourdusamy, I. Dhivviyanandam, Lian Mathew

Let $G$ 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…