Split Domination Number of Rooted Product of Some Simple Graph

EasyChair Preprint 7379

Abstract

Kulli and Janakiram first proposed the concept of a split domination number. Let G be a graph with V as the vertex set and S as the subset of V as the vertex set. S is said to be a dominating set when every vertex in V-S is adjacent to at least one vertex of S. The graph has a split dominating set if the induced sub graph is disconnected. In this article, we studied split domination in graph theory for many types of special graphs.

Keyphrases: Domination number, Rooted product, Split domination number, comb graph

@booklet{EasyChair:7379,
  author    = {N Parvathi and R Arasu},
  title     = {Split Domination Number of Rooted Product of Some Simple Graph},
  howpublished = {EasyChair Preprint 7379},
  year      = {EasyChair, 2022}}