Weakly Connected Domination in Graphs

In the last 50 years, Graph theory has seen an explosive growth due to interaction with areas like computer science, electrical and communication engineering, Operations Research etc. Perhaps the fastest growing area within graph theory is the study of domination, the reason being its many and varied applications in such fields as social sciences, communication networks, algorithm designs, computational complexity etc. Henda C. Swart has rightly commented that the theory of domination in graphs is like a ‘growth industry’. There are several types of domination depending upon the nature of domination and the nature of the dominating set. In the following, we present weakly connected domination in connected graphs.