Scribd
Upload
91 views

Assignment 5

This document contains 17 questions about graph theory concepts including connectivity (κ), edge connectivity (κ0), and block trees. It asks the reader to determine the connectivity and edge connectivity of various graphs, prove statements about how connectivity is impacted by operations like edge subdivision and contraction, find counterexamples to proposed properties, and prove properties of hypercube graphs and block trees. The questions cover a range of fundamental graph theory topics.

Uploaded by

man human
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
91 views

Assignment 5

This document contains 17 questions about graph theory concepts including connectivity (κ), edge connectivity (κ0), and block trees. It asks the reader to determine the connectivity and edge connectivity of various graphs, prove statements about how connectivity is impacted by operations like edge subdivision and contraction, find counterexamples to proposed properties, and prove properties of hypercube graphs and block trees. The questions cover a range of fundamental graph theory topics.

Uploaded by

man human
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Graph Theory Assignment-5 October 2022

1. Consider the graph G shown below. Find κ(G) and κ0 (G).

2. Consider the graph G shown below. Find κ(G) and κ0 (G).

3. Every graph with connectivity 4 is 4-connected


true
false

4. Every 2-edge-connected graph is 2-connected


true
false

5. Every 2-connected graph is 2-edge connected.


true
false

6. Let G be 2-connected and (u, v) ∈ E(G). Then G − (u, v) is


connected
disconnected
cannot say
7. Let G be 2-edge-connected graph. Then
every edge is not necessarily in a cycle
every edge of G is in a cycle

8. Let G be a simple graph with v vertices and δ(G) ≥ v − 2, then prove that κ(G) = δ(G).

9. Let G be a simple graph with ∆(G) ≤ 3. Then prove that κ(G) = κ0 (G).

10. In a graph G, subdivision of an edge (u, v) is the operation of replacing (u, v) with a
path uwv through a new vertex w. Prove that if G is 2-connected and G0 is obtained
from G by subdividing an edge of G, then G0 is 2-connected.

11. For a connected graph G with at least three vertices, prove that the following statements
are equivalent:
(A) G is 2-edge connected.
(B) Every edge of G appears in a cycle.

12. Prove that if G is 2-edge-connected and G0 is obtained from G by subdividing an edge


of G, then G0 is 2-edge-connected.

13. Show that deleting an edge of a graph G reduces the vertex connectivity by at most 1.

14. Let G be a 3-connected graph, and (x, y) is an edge in G. Let G0 be obtained by


contracting the edge (x, y) in G. Show that κ(G0 ) = 3 iff κ(G − {x, y}) = 2.

15. Find a simple graph G for which κ(G) < κ0 (G) < δ(G) (Strict inequalities).

16. We define the hypercube graphs Qm as follows: V (Qm ) = {binary strings of length m}.
Two vertices of Qm are adjacent if they differ at exactly 1 position.
(a) Find κ(Qm ). (Hint: Try induction)
(b) Find κ0 (Qm )

17. Block Trees A Block B in a connected graph G is either a maximal 2-connected sub-
graph or a bridge in G. Prove the following:
(a) If C is a cycle in G, then C completely lies inside some block B.
(b) Two blocks intersect only at one vertex. This is a cut vertex.
(c) Let B = {B : B is a block of G} and A = {a : a is a cut vertex }. Define a graph
G∗ with V (G∗ ) = A ∪ B and E(G∗ ) = {(a, B) : a ∈ B, for a ∈ A, B ∈ B}. Show
that G∗ is a tree. This is called the block tree of G.

You might also like