ALGORITHMIC APPROACH FOR DOMINATION NUMBER OF UNICYCLIC GRAPHS

Let ????(????, ????) be a unicyclic graph. A unicyclic graph is a connected graph that contains exactly one cycle. A dominating set of a graph G = (V, E) is a subset D of V, such that every vertex which is not in D is adjacent to at least one member of D. The domination number is the number of vertices in a smallest dominating set for G. In this paper I have presented an algorithmic approach to compute the domination number and the minimum domination set for the unicyclic graph. The algorithm has polynomial time complexity of ????(????).