关于图的K-限制边连通度的最优性和超级性.pdfVIP

Æ G = (V, E), V G E G n(G) = |V |. X ⊆ V (G),G[X] X X = V (G) − X. A, B ⊆ V (G),[A, B] A B ∂ (X ) =| [X, V − X] | X k n(≥ 2k) G = (V, E), S G k- G − S G − S k R - G k R - ( λ - ) G k- λ (G) k k k λ . λ (G) G λ - k k k ξk (G)=min {∂ (X ) : X ⊆ V (G), | X |= k, G[X] }. [X, X] G λ - X ,X λ - G λ -