Add to ORKGLet G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the induced subgraph (S) is complete. In this paper we introduce several parameters using equivalence sets and discuss their relation with other graph theoretic parameters
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to at leas...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
Let G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the in...
For a graph G = (V, E), a subset S ⊆ V (G) is an equivalence dominating set if for every vertex v ∈ ...
Let <i>G</i> = (<i>V, E</i>) be a graph. A subset <i>S</i> of <i>V</i> is called an <i>equivalence s...
Click on the link to view the abstract.Keywords: Equivalence domination, total domination, P3-formin...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
Given a graph G and a function f : V(G) ? {0,1,2,...}, a subset D of V(G) is called an f-dominating ...
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...
Let G = (V, E) be a connected graph. A set D subset-of V is a set-dominating set (sd-set) if for eve...
This thesis deals with domination parameters in graphs and in particular with their unique realizati...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to at leas...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
Let G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the in...
For a graph G = (V, E), a subset S ⊆ V (G) is an equivalence dominating set if for every vertex v ∈ ...
Let <i>G</i> = (<i>V, E</i>) be a graph. A subset <i>S</i> of <i>V</i> is called an <i>equivalence s...
Click on the link to view the abstract.Keywords: Equivalence domination, total domination, P3-formin...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
Given a graph G and a function f : V(G) ? {0,1,2,...}, a subset D of V(G) is called an f-dominating ...
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...
Let G = (V, E) be a connected graph. A set D subset-of V is a set-dominating set (sd-set) if for eve...
This thesis deals with domination parameters in graphs and in particular with their unique realizati...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to at leas...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...