A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
<p>Dominating set $S$ in graph $G=(V,E)$ is a subset of $V(G)$ such that every vertex of $G$ which is not element of $S$ are connected and have distance one to $S$. Minimum<span style="text-decoration: underline;"> cardinality</span> among dominating sets in a graph $G$ is called dominating number of graph $G$ and denoted by $\gamma(G)$. While dominating set ofdistance two which denoted by $S_2$ is a subset of $V(G)$ such that every vertex of $G$ which is not element of $S$ are connected anddoi:10.19184/ijc.2016.1.1.5 fatcat:4gfzmp55ijc3hpwhaxv7cspcq4