Superior Eccentric Domination Polynomial

In this paper we introduce the superior eccentric domination polynomial SED(G, φ) = β\sum_{ l=\gamma_{sed}(G)} |sed(G, l)|φ^{l} where |sed(G, l)| is the number of all distinct superior eccentric dominating sets with cardinality l and \gamma_{sed}(G) is superior eccentric domination number. We find SED(G, φ) for different standard graphs. Results are presented.