In general an undirected graph is an interval graph (IG), if the vertex set V can be put into one-to-one correspondence with a set of intervals on the real line, such that two vertices are adjacent in G if and only if their corresponding intervals have non-empty intersection. The set I is called an interval representation of G and G is referred to as the intersection graph Let be any interval family where, each is an interval on the real line and,...