However, while these give an absolute lower bound on the amount of connection needed, most such networks prefer a k-connected graph to a tree, so that failure of an any individual link will not split the network into parts.
Kako god, dok ove daju apsolutnu donju granicu na iznos potrebnih veza, uglavnom takve mreže preferiraju k-povezan graf u drvo, tako da neuspeh bilo koje veze pojedinačno neće podeliti mrežu na delove.