Bandwagon Eccentric Domination Polynomial and its Energy in Graphs

Abstract

Kathiresan In this article, bandwagon eccentric domination polynomial BED (G , x) is introduced. Theorems related to the characteristics of coefficients of BED (Sn ,x) of a star graph is discussed and the coefficients of BED (Sn ,x) are tabulated. Minimum bandwagon eccentric dominating energy IEbed (G) is also defined. IEbed (G) of families of graphs are computed and the properties of minimum bandwagon eccentric dominating eigenvalues are obtained. Results related to upper and lower bounds for IEbed (G) of cocktail party, complete, crown and star graphs are discussed.