Let G be a connected graph of order n = 4 and let k be an integer with 2 ≤ k ≤ n − 2. a)Prove that if G is not k-connected, then G contains a vertex-cut U with |U| = k − 1? b) if G is not k-edge-connected, then G contains an edge-cut X with |X| = k − 1

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 80EQ
icon
Related questions
Question

Let G be a connected graph of order n = 4 and let k be an integer with 2 ≤ k ≤ n − 2.

a)Prove that if G is not k-connected, then G contains a vertex-cut U with |U| = k − 1?

b) if G is not k-edge-connected, then G contains an edge-cut X with |X| = k − 1

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning