$k$-Isolate Domination Number of Splitting Graph of Simple Graphs
Abstract views: 46 / PDF downloads: 61
Keywords:
Dominating set, Isolate dominating set, $k$-isolate dominating set, $k$-isolate domination number, splitting graphAbstract
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
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.