$k$-Isolate Domination Number of Splitting Graph of Simple Graphs


Abstract views: 46 / PDF downloads: 61

Authors

  • G. Rajasekar Department of Mathematics, Jawahar Science College, Neyveli, Tamilnadu, India
  • A. Jeslet Kani Bala Department of Mathematics, Jawahar Science College, Neyveli, Tamilnadu, India

Keywords:

Dominating set, Isolate dominating set, $k$-isolate dominating set, $k$-isolate domination number, splitting graph

Abstract

A dominating set $S$ of a graph $G$ is said to be a $k$-isolate dominating set if $\left\langle S \right\rangle$ has at least $k$-isolated vertices \cite{grjkb1}. In this paper the $k$-isolate dominating set of splitting graph of some graphs such as path, cycle and complete graphs are found.

Downloads

Published

15-06-2021

How to Cite

G. Rajasekar, & A. Jeslet Kani Bala. (2021). $k$-Isolate Domination Number of Splitting Graph of Simple Graphs. International Journal of Mathematics And Its Applications, 9(2), 13–16. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/60

Issue

Section

Research Article