THE NUMBER OF CC-DOMINATING SETS OF SOME GRAPHS

Abstract

The aim of this paper is to study about the number of cc-dominating sets and to introduce the concept of cc-domination polynomial for simple finite undirected graphs. For a graph G on n vertices possessing dc (G,i) cc-dominating sets of cardinality i, the cc-domination polynomial is defined as Dc [G;x]= n i=γcc (G) dc (G,i) xi, whereγ cc(G) is the cc-domination number of G. We obtain some properties of Dc[G;x] and compute the same for some special graphs. Moreover, the concept of cc-domination entropy is also introduced and studied.