Add to ORKGIn this paper is discussed about exact value of neighbourhood total domination number in graphs. Let graph . A set of be a subset of is called a dominating set if each vertex of is adjacent to at least one vertex of is graph . The minimum cardinality of dominating set in is called domination number and denoted . Let be a subset of , set is called a neighbourhood set if ⋃ 〈 〉 with 〈 〉 the induced subgraph of by . A dominating set of a graph is called neighbourhood total dominating set (ntdset) if the induced subgraph 〈 〉 contains no isolated vertices. The minimum cardinality of a ntd-set of is called the neighbourhood total domination number of and is denoted by . Further be obtained the exact value in path graphs, cycle graphs, tre...
Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at leas...
In this paper, we obtain the domination number, the total domination number and the independent domi...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
Set subset ofvertex set is called dominating set if each vertex of is adjacent to at least one vert...
A set S of vertices in a graph G = (V, E) is said to be a k-distance neighbourhood dominating set, i...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
Let G = (V; E) be a graph. A subset D of V is called common neighbourhood dominating set (CN-domi-na...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
Abstract: A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each ve...
Let be a simple, finite and undirected graph and without isolated vertex. A subset D of V is s...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A subset S of VG is called a total dominating set of a graph G if every vertex in VG is adjacent to ...
A set S?V of vertices in a graph G=(V,E) without isolated vertices is a {em total dominating set} if...
Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at leas...
In this paper, we obtain the domination number, the total domination number and the independent domi...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
Set subset ofvertex set is called dominating set if each vertex of is adjacent to at least one vert...
A set S of vertices in a graph G = (V, E) is said to be a k-distance neighbourhood dominating set, i...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
Let G = (V; E) be a graph. A subset D of V is called common neighbourhood dominating set (CN-domi-na...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
Abstract: A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each ve...
Let be a simple, finite and undirected graph and without isolated vertex. A subset D of V is s...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A subset S of VG is called a total dominating set of a graph G if every vertex in VG is adjacent to ...
A set S?V of vertices in a graph G=(V,E) without isolated vertices is a {em total dominating set} if...
Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at leas...
In this paper, we obtain the domination number, the total domination number and the independent domi...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...