Shih-Ping Huang

Learn More
Distance two domination has practical usage in resource sharing problem. 3,2,1 D-domination problem is a variable of distance two domination. For a graph   ,  G V E , let  D V. Assume that every vertex v in D can get resource completely and share partial resource with its neighbors and offer little resource to the vertices that are distance two from it.(More)
  • 1