Algorithmic aspects of domination number in nano topology induced by graph.

The basic intention of this paper is to impart the importance of Nano topology induced by graph. Nano topology induced by graph paves us a method to find the well-known parameter of a graph, namely its domination number as well as all the possible dominating sets of a graph. In general, each paper, depending upon the author's axe (or the pen), has its own point of emphasis. Accordingly, in this paper, the computational and algorithmic aspects of graph are emphasized. By experience, we know that to solve a problem using graph theory leads to a large graph virtually impossible to analyze without the aid of a computer. Hence, to simplify the problem we have used a Java program code that suits even for all graphs of finite number of vertices. We have made an attempt to find the proper location of guards and minimize the number of guards to observe all the warning lights in a nuclear power plant using such a Java program code. [ABSTRACT FROM AUTHOR]