Inverse Independent Domination in Interval Graphs

Abstract

A set   is an independent dominating set if  is adjacent to at least one vertex in  and no two vertices in  are adjacent. A set  is called an inverse independent dominating set w.r.t  if  contains an independent dominating set, where  is a minimum independent dominating set of graph  In this paper, we develop an algorithm for existence of an inverse independent dominating set w.r.t a minimum independent dominating set for an interval family and also, we obtain some results.