Now showing items 1-1 of 1

    • Domination Number of Vertex Amalgamation of Graphs 

      Y. Wahyuni; M. I. Utoyo; Slamin, Slamin (2017-09-11)
      For a graph G = (V, E), a subset S of V is called a dominating set if every vertex x in V is either in S or adjacent to a vertex in S. The domination number 𝜸(𝑮) is the minimum cardinality of the dominating set of G. ...