Superior domination polynomial of cycles

Abstract

Superior domination polynomial SD(G, x) is a polynomial in which the power of the variable denotes the cardinality of a superior dominating set and the total number of sets of same cardinality forms the coefficient of the variable. In this paper we find the SD(Cn, x) of cycle graphs. The results related to the polynomial SD(Cn, x) is stated and the proved.

Keywords

• superior distance, superior domination, neighbourhood vertex, superior domination polynomial.