Inverse Domination Parameters of Jump Graph

Abstract

Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D. Theminimum cardinality of an inverse dominating set of G is called inverse domination number of G. In this article, we determine inverse domination parameters of jump graph of a graph.

Keywords

• dominating set, labeling, digraphs, di-cyclic, di-quadrilateral, di-pentagonal, snake.