I. Dhivviyanandam

collaborators

2 papers

math.CO2024

Detour Monophonic Vertex Cover Pebbling Number (DMVCPN) of Some Standard Graphs

K. Christy Rani, I. Dhivviyanandam

Let $G$ be a connected graph with vertex set $V (G)$ and edge set $E (G)$ . Pebbling shift is a deletion of two pebbles from a vertex and a placement of one pebble at a neighbouring v…

math.CO2023

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…