Skip to content
Submit
Close search
Cart
Cart
expand/collapse
Minimal k-arc Connected Graphs
Regular price
$15.00
$12.00
Sale
Format
Paperback
Paperback
Add to cart
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).