ON WEAKLY CONNECTED DOMINATING POLYNOMIAL OF BI-STAR, SPIDER, BANANA AND COMPLETE BIPARTITE GRAPHS
Let be a simple graph. Then a dominating set is a weakly connected dominating set of G, if the subgraph obtained from G by removing all edges each any two vertices in is connected. The weakly connected dominating polynomial of G is defined as where is the weakly connected domination number of G. In this paper, we determine the weakly connected dominating polynomial of the bi-star graph spider graph banana graph and complete bipartite graph
simple connected graph, weakly connected dominating polynomial of a graph, weakly dominating number of a graph.