Domination Polynomials of Unidirectional Star

Abstract

Let  be a finite directed graph without isolated node. The domination polynomial of  is defined by  D(G, x) where  d(G, i)is the cardinality of the set of dominating sets of  with  nodes. In this paper, we study the domination polynomial of unidirectional star graphs.