A set S  V is a induced -paired dominating set if S is a dominating set of G and the induced subgraph <S> is a perfect matching. The induced - paired domination number ip(G) is the minimum cardinality taken over all paired dominating sets in G. The minimum number of colours required to colour all the vertices so that adjacent vertices do
not receive the same colour and is denoted by (G). The authors4characterized the classes of graphs whose sum of induced paired domination number and chromatic number equals to 2n 6, for any n  4.

In this paper we extend the above result and characterize the classes of all graphs whose sum of induced paired domination number and chromatic number equals to 2n - 7, for any n  4.