New Characterization Of (1,2)S_P-Kernel In Bitopological Spaces

Let J(G)=(V,E) be a jump graph. Let D be a nominal prevailing (dominating) set in a jump graph J(G). If V-D contains a prevailing set D\primeof J(G), then D\prime is called an inverse prevailing set with respect to D. The nominal cardinality of an inverse prevailing set of a jump graph J(G) is called inverse domination number of J(G). In this paper, we computed some interconnections betwixt inverse domination number of jump graph for some graphs.