Minimal k-arc-connected graphs.

Minimal k-arc-connected graphs.

Regular price $15.00 $12.00 Sale

A solution to the problem of determining the fewest number of arcs required in a k-arc-connected graph on n nodes by describing constructions that produce such graphs having kn/2 arcs (for kn even) or (kn + 1)/2 arcs (for kn odd). (A linear graph is ...