Bound of Distance Domination Number of Graph and Edge Comb Product Graph
A.W. Gembong, Slamin Slamin, Dafik Dafik, Ika Hesti Agustin · Journal of Physics Conference Series · 2017
Let G = (V, E) be a simple, nontrivial, finite, connected and undirected graph.For an integer 1In this paper, we improve the lower bound on the distance domination number of G regarding to the diameter and minimum degree as well as the upper bound regarding to the order and minimum k distance neighbourhood.In addition, we determine the bound of distance domination number of edge comb product graph.