Now showing items 1-1 of 1

    • On the Domination Number of Some Graph Operations 

      N.Y. Sari, I.H. Agustin, Dafik (2016-02-02)
      A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $u\in V(G)-D$ is adjacent to some vertex $v\in D$. The domination number of a ...