In this paper, we continue the study of neighborhood total domination in graphs first studied by Arumugam and Sivagnanam [Opuscula Math. 31 (2011), 519–531]. A neighborhood total dominating set, abbreviated NTD-set, in a graph G is a dominating set S in G with the property that the subgraph induced by the open neighborhood of the set S has no isolated vertex. The neighborhood total domination n...

In a graph G, an efficient dominating set is a subset D of vertices such that D is an independent set and each vertex outside D has exactly one neighbor in D. The Minimum Weight Efficient Dominating Set (Min-WED) problem asks for an efficient dominating set of total minimum weight in a given vertex-weighted graph; the Maximum Weight Efficient Dominating Set (Max-WED) problem is defined similarl...

Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested in solving the problem on graphs having a large independent set. Given a graph G with an independent set of size z, we show that the problem can be solved in time O∗(2n−z), where n is the number of vertices of G. As a consequence, our algorithm is able t...

We initiate the study of total outer-independent domination in graphs. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V (G) \ D is independent. The total outer-independent domination number of a graph G is the minimum cardinality of a total outer-independent dominating set of G. First we discuss the ...

A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − ‫〉ܦ‬ is connected. The Non-split domination number ߛ ௡௦ ሺ‫ܩ‬ሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௡௦ ሺ‫ܩ‬ሻwith other known parameters of IFG G. 1. In...

A set D of vertices in a graph G = (V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total domination number γt(G) is the minimum cardinality of a total dominating set. E(G) denotes the edge set of G, the complement of G. The minimum cardinality of a set E1 ⊂ E(G) for which γt(G+E1) < γt(G) is denoted by rt(G) and is called the total rein...

Let R be a commutative ring and Z(R) be its set of all zero-divisors. D. F. Anderson and A. Badawi[2] introduced the total graph of R, denoted by TΓ(R), as the undirected graph with vertex set R, and two distinct vertices x and y are adjacent if and only if x+ y ∈ Z(R). For a commutative Artin ring R, T. Tamizh Chelvam and T. Asir[15] obtained the domination number of the total graph and studie...