A New Algorithm for Finding a Minimum Dominating Set of Graphs
P. Pradhan, B. S. Rawat · International Journal of Computer Applications · 2014
In the present paper the concept of relative domination power of vertices for finite undirected graphs have been introduced.An algorithm has been developed to obtain a minimum dominating set of a graph.Some results related to domination number and other graph theoretic parameters for a tree also obtained.