Assume that G = (V, E) represents a graph that doesn't have any isolated vertices. If the induced subgraph N(S) = V(G) does not contain any isolated vertices, then the dominating set S of graph G is referred to as a neighborhood total dominating set (ntd-set) . The cardinalities that must be present in order for a set to be considered an ntd-set of G is referred to as the neighborhood total domination number of G, and it is represented by the symbol nt (G). The neighborhood total domination number of G is the maximum order of a partition of V into ntd-sets. This number is denoted by the symbol dnt(G) and represents the maximum order of a partition of V . Some good result present hrer.
