The comparision of minimum indepent neighbourhood set and the bondage of an interval graph g

Interval graphs have a wide variant of applications to varies branches of science and technology. Among the varies applications of the theory of domination, independent neighborhood sets the most often discussed is a communication networks. This network consists of communication links between a fixed set of sides. Suppose communication network does not work due to link failure. Then the problem is, what is the fewest number of communication links such that at least one additional transmitter would be required in order that communication with all sides be possible. This leads to the introduction of the concepts of minimum independent neighborhood set and bondage number of a graph. In this paper we discuss the comparison of minimum independent neighborhood set and the bondage number of an interval graph G.