INVERSE DOMINATION OF AN UNDIRECTED GRAPH ON A FINITE SUBSET OF NATURAL NUMBERS

Abstract

Abstract: An undirected graph on a finite subset of natural numbers is an undirected graph whose vertex set is : gcd and  are adjacent if and only if gcd. In this paper the concept of inverse domination and inverse total domination is discussed and the results are presented at various