A randomized parallel linked residual network Gr =(V'£j) is presented. Algorithmically the residual network, which produces successive shortest path distances and the original graph G=(V,E) is solved. This result is optimum ...

A set D of vertices in a graph G = (V, E) is a dominating set of (j if every vertex in V-D is adjacent to some vertex in D. The domination number of G i, the minimum cardinality taken over all minimal dominating sets in ...