... framework of random graph. Nodes and links of a net-workareconsideredasverticesandedgesofarandomgraphG(V,E), respectively, w here V is the set of vertices, each witha random location, and E is ... value of node degree, including that of the source and that of the ter-minal. Thus, it is easy to understand that k(R)isnogreaterthan F(R). In fact, for any two positive random variables x and ... normalized m ax-flow capacity of networks in thecuboid spaces, (a) 1× 1 × 1, (b) 1 × 1 × 5, and (c) 0.5 ×1 × 2.randomly chosen in each random graph, and the algorithm of the C++ program follows...