BOUNDS ON INVERSE DOMINATION IN SQUARES OF GRAPHS

Abstract

Let be a minimum dominating set of a square graph . If ( ) − contains another dominating set of , then is called an inverse dominating set with respect to . The minimum cardinality of vertices in such a set is called an inverse domination number of and is denoted by ( ). In this paper, many bounds on ( ) were obtained in terms of elements of . Also its relationship with other domination parameters was obtained.