Discrete

Question

Let G=(V,E) be a simple graph. Let S⊂V and [S,S¯] be a smallest edge cut of G. Then a tight lower bound for ∣∣[S,S¯]∣∣ is

(a)  n-1

(b) κ(G)

(c) δ(G)