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
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
AbstractIn this note, we give a finite forbidden subgraph characterization of the connected graphs f...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
AbstractIn this paper we characterize the class of trees, unicyclic graphs and cubic graphs for whic...
AbstractArumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicycli...
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 ...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
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...
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...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
AbstractWe provide a simple constructive characterization for trees with equal domination and indepe...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
AbstractIn this note, we give a finite forbidden subgraph characterization of the connected graphs f...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
AbstractIn this paper we characterize the class of trees, unicyclic graphs and cubic graphs for whic...
AbstractArumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicycli...
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 ...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
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...
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...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
AbstractWe provide a simple constructive characterization for trees with equal domination and indepe...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
AbstractIn this note, we give a finite forbidden subgraph characterization of the connected graphs f...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
DOI
Add to ORKG