A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Inverse Independence Number of a Graph

2012
*
International Journal of Computer Applications
*

The concept of inverse domination was introduced by Kulli V.R. and Sigarakanti S.C. [9] . Let D be a -set of G. A dominating set D 1 V-D is called an inverse dominating set of G with respect to D. The inverse domination number (G) is the order of a smallest inverse dominating set. Motivated by this definition we define another parameter as follows. Let D be a maximum independent set in G. An independent set S V-D is called an inverse independent set with respect to D. The inverse

doi:10.5120/5687-7734
fatcat:ynifewxh2fd3nh4u7ly5ldqe6e