International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 85 - Issue 19 |
Published: January 2014 |
Authors: P. Pradhan, B. S. Rawat |
![]() |
P. Pradhan, B. S. Rawat . A New Algorithm for Finding a Minimum Dominating Set of Graphs. International Journal of Computer Applications. 85, 19 (January 2014), 9-13. DOI=10.5120/15093-3301
@article{ 10.5120/15093-3301, author = { P. Pradhan,B. S. Rawat }, title = { A New Algorithm for Finding a Minimum Dominating Set of Graphs }, journal = { International Journal of Computer Applications }, year = { 2014 }, volume = { 85 }, number = { 19 }, pages = { 9-13 }, doi = { 10.5120/15093-3301 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2014 %A P. Pradhan %A B. S. Rawat %T A New Algorithm for Finding a Minimum Dominating Set of Graphs%T %J International Journal of Computer Applications %V 85 %N 19 %P 9-13 %R 10.5120/15093-3301 %I Foundation of Computer Science (FCS), NY, USA
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.