The independent domination number of a graph , denoted , is the minimum size of an independent dominating set of . In this talk, we prove a series of results regarding independent domination of graphs with bounded maximum degree. Let be a graph with maximum degree at most where . We prove that …