AbstractArumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicyclic graphs and cubic graphs with equal domination and connected domination numbers. In this paper, we extend their results and characterize the class of block graphs and cactus graphs for which the domination number is equal to the connected domination number
Let G=(V,E) be a simple graph. A set S⊆V is a dominating set if every vertex in V∖S is adjacent to a...
In this paper we explore graphs having same domination number and independent domination number . S...
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...
AbstractArumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicycli...
AbstractIn this paper we characterize the class of trees, unicyclic graphs and cubic graphs for whic...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
AbstractLet G be a simple graph, and let p be a positive integer. A subset D⊆V(G) is a p-dominating ...
The details of this abstract can be found in the full paper.Key words: Subdivision graph, Block subd...
For a graph G a subset D of the vertex set of G is a k-dominating set if every vertex not in D has a...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set of G if every vertex not in S is adjac...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractThe tree-free domination number γ(G;−Tk), k⩾2, of a graph G is the minimum cardinality of a ...
AbstractWe provide a simple constructive characterization for trees with equal domination and indepe...
A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset...
Let G=(V,E) be a simple graph. A set S⊆V is a dominating set if every vertex in V∖S is adjacent to a...
In this paper we explore graphs having same domination number and independent domination number . S...
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...
AbstractArumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicycli...
AbstractIn this paper we characterize the class of trees, unicyclic graphs and cubic graphs for whic...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
AbstractLet G be a simple graph, and let p be a positive integer. A subset D⊆V(G) is a p-dominating ...
The details of this abstract can be found in the full paper.Key words: Subdivision graph, Block subd...
For a graph G a subset D of the vertex set of G is a k-dominating set if every vertex not in D has a...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set of G if every vertex not in S is adjac...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractThe tree-free domination number γ(G;−Tk), k⩾2, of a graph G is the minimum cardinality of a ...
AbstractWe provide a simple constructive characterization for trees with equal domination and indepe...
A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset...
Let G=(V,E) be a simple graph. A set S⊆V is a dominating set if every vertex in V∖S is adjacent to a...
In this paper we explore graphs having same domination number and independent domination number . S...
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...