Upper bounds for independent domination in regular graphs

Let G be a regular graph of order n   and degree δδ. The independent domination number  i(G)i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. We establish upper bounds, as functions of n   and δδ, for the sum and product of the independent domination numbers of a regular graph and its complement.