The mixed tree domination polynomial of a connected graph G of order n is the polynomial p(i)xi, where p(i) is the number of mixed tree dominating sets of G of cardinality i and γmt(G) is the mixed tree domination number of G. We analyse the specifications of the polynomial. Also P(G, x) is determined for cycles, complete graphs and stars, and the roots of P(G, x) are studied.
Keywords and Phrases
Domination, Mixed tree domination, domination polynomial, Mixed tree domination polynomial (mtd? polynomial).
A.M.S. subject classiﬁcation