THE CO-CONNECTED DOMINATION POLYNOMIAL OF A GRAPH
Let be any connected graph of order p. The co-connected domination polynomial of a graph G is the polynomial where is the number of co-connected dominating sets of size i and is the co-connected domination number of G. In this paper, we obtain some properties and exact values of of some special classes of graphs. Also, some results of in terms of product graphs are presented.
co-connected dominating set, co-connected domination number and co-connected domination polynomial.