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

arXiv2305.04463MaRDI QIDQ6435709FDOQ6435709

Authors: A. Lourdusamy, I. Dhivviyanandam, Lian Mathew 

Publication date: 8 May 2023

Abstract: 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 non-split domination cover pebbling number, $ps{i}_{ns}(G)$, of a graph $G$ is the minimum of pebbles that must be placed on $V(G)$ such that after a sequence of pebbling moves, the set of vertices with a pebble forms a non-split dominating set of $G$, regardless of the initial configuration of pebbles. We discuss some basic results, NP-completeness of non-split domination number, and determine $ps{i}_{ns}$ for some families of Middle graphs.

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

This page was built for publication: Non-split Domination Cover Pebbling Number for Some Class of Middle Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435709)