• Publications
  • Influence
Weakly connected independent and weakly connected total domination in a product of graphs
In this paper we characterize the weakly connected independent and weakly connected total dominating sets in the lexicographic product graphs. The weakly connected independent and weakly connectedExpand
  • 3
  • PDF
Weakly connected total domination in graphs
Let G = (V (G), E(G)) be a connected undirected graph. The closed neighborhood of any vertex v ∈ V (G) is NG[v] = {u ∈ V (G) : uv ∈ E(G)} ∪ {v}. For C ⊆ V (G), the closed neighborhood of C is N [C] =Expand
Weakly Connected Domination in Graphs Resulting from Some Graph Operations
Let G = (V (G),E(G)) be a connected undirected graph. The closed neighborhood of any vertex v ∈ V (G) is NG[v] = {u ∈ V (G) : uv ∈ E(G)} ∪ {v}. For C ⊆ V (G), the closed neighborhood of C is N [C] =Expand
  • 6
  • PDF
Weakly connected dominating sets in the lexicographic product of graphs
In this paper we characterize the weakly connected dominating sets in the lexicographic product of two connected graphs. From these characterization, we easily determine the weakly connectedExpand
  • 2
  • PDF