For an (r − 2)-edge-connected graphG (r ≥ 3) for orderp containing at mostk edge cut sets of cardinalityr − 2 and for an integerl with 0 ≤l ≤ ⌊p/2⌋, it is shown that (1) ifp is even, 0 ≤k ≤ r(l + 1) − 1, and
Character limit 500/500