Scribd
Upload
51 views16 pages

DM - Graph Connectivity: NGUYEN Hoang Thach

This document discusses graph connectivity. It begins by defining paths, connectedness, and connectivity in undirected graphs. It then discusses cut vertices, bridges, vertex connectivity, and edge connectivity. The document then covers the same topics for directed graphs, defining paths, strong connectivity, and strongly connected components.

Uploaded by

Katto - Darling in the Piano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views16 pages

DM - Graph Connectivity: NGUYEN Hoang Thach

This document discusses graph connectivity. It begins by defining paths, connectedness, and connectivity in undirected graphs. It then discusses cut vertices, bridges, vertex connectivity, and edge connectivity. The document then covers the same topics for directed graphs, defining paths, strong connectivity, and strongly connected components.

Uploaded by

Katto - Darling in the Piano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

DM – Graph connectivity

NGUYEN Hoang Thach


[email protected]

29/05/2020
Outline

1 Undirected graph
Path and connectedness
Vertex connectivity and edge connectivity

2 Directed graph

H.-T. Nguyen Connectivity 29/05/2020 2 / 16


Outline

1 Undirected graph
Path and connectedness
Vertex connectivity and edge connectivity

2 Directed graph

H.-T. Nguyen Connectivity 29/05/2020 3 / 16


Path
Definition
Let G = (V , E ) be a graph. A path of length n from a vertex u to a vertex v is
defined by a sequence of edges e1 , e2 , . . . , en such that ei = (xi−1 , xi ) and
x0 = u, xn = v .
When the graph is simple, this path can be identified with the vertex sequence
u = x0 , x1 , x2 , . . . , xn = v .
If u = v and n > 0, then the path is a circuit (or cycle).
A path or circuit is simple if it does not pass by the same edge more than once.

Example:

e1 e2 e4 e6 or v4 v1 v5 v2 v3 is a path of
length 4 from v4 to v3 .
e4 e5 e6 is a circuit of length 3.

H.-T. Nguyen Connectivity 29/05/2020 4 / 16


Distance and diameter

Definition
Let G = (V , E ) be a graph.
1 The distance d(u, v ) between two vertices u and v is the length of the
shortest simple path between them. If no such path exists, the distance is
infinite.
2 The diameter of G is the greatest distance between any pair of its vertices.

Example:

d(v1 , v2 ) = 2 , d(v3 , v5 ) = 1.
The diameter of the graph is 2.

H.-T. Nguyen Connectivity 29/05/2020 5 / 16


Connected graph
Definition
A graph G is connected if there exists a path between every pair of its vertices.

Examples: G1 is connected, G2 is not connected (or disconnected).

Theorem
There exists a simple path between every pair of vertices of a connected graph.

H.-T. Nguyen Connectivity 29/05/2020 6 / 16


Connected component

Definition
Let G be a graph. A connected component of G is a maximal connected subgraph
of G, ie. it is not a proper subgraph of another connected subgraph of G.

H.-T. Nguyen Connectivity 29/05/2020 7 / 16


Counting paths

Theorem
Let G be a graph with adjacency matrix A. For all positive integer k, the number
of different paths of length k from u to v is the (u, v )-th entry of Ak .

Note: The theorem also holds for multigraphs with loops.

Corollary
Let G be a graph with adjacency matrix A. The graph G is conneced if and only if
there exists a positive integer k such that every entry of Ak is positive.

H.-T. Nguyen Connectivity 29/05/2020 8 / 16


Outline

1 Undirected graph
Path and connectedness
Vertex connectivity and edge connectivity

2 Directed graph

H.-T. Nguyen Connectivity 29/05/2020 9 / 16


Cut vertices and bridges

Definition
Let G be a graph.
1 A vertex v is a cut vertex (or articulation point) if G − v has more connected
components than G.
2 An edge e is a bridge if G − e has more connected components than G.

Examples: The vertex c is a cut vertex, the edge {c, e} is a bridge. The vertex a
is not a cut vertex.

H.-T. Nguyen Connectivity 29/05/2020 10 / 16


Vertex connectivity

Definition
Let G = (V , E ) be a graph.
1 A set W ⊂ V is a vertex cut if G − W is disconnected.
2 The vertex connectivity of G, denoted by κ(G), is the size of the smallest
vertex cut of G.
By convention, κ(Kn ) = n − 1.
3 The graph G is k-(vertex-)connected if κ(G) ≥ k.

H.-T. Nguyen Connectivity 29/05/2020 11 / 16


Vertex connectivity

H.-T. Nguyen Connectivity 29/05/2020 12 / 16


Edge connectivity

Definition
Let G = (V , E ) be a graph.
1 A set F ⊂ E is a edge cut if G − F is disconnected.
2 The edge connectivity of G, denoted by λ(G), is the size of the smallest edge
cut of G.
By convention, κ(K1 ) = 0.

Theorem
If G = (V , E ) is a non-complete connected graph with at least three vertices, then

κ(G) ≤ λ(G) ≤ min deg(v ) .


v ∈V

H.-T. Nguyen Connectivity 29/05/2020 13 / 16


Path

Definition
Let G = (V , A) be a directed graph. A path of length n from a vertex u to a
vertex v is defined by a sequence of arcs a1 , a2 , . . . , an such that ai = (xi−1 , xi )
and x0 = u, xn = v .
When the directed graph is simple, this path can be identified with the vertex
sequence u = x0 , x1 , x2 , . . . , xn = v .
If u = v and n > 0, then the path is a circuit (or cycle).
A path or circuit is simple if it does not pass by the same edge more than once.

H.-T. Nguyen Connectivity 29/05/2020 14 / 16


Connectedness
Definition
A directed graph G is strongly connected if for every pair of vertices u and v ,
there is a path from u to v and a path from v to u.

Note: A directed graph is (weakly) connected if the underlying undirected graph


is connected. Strong connectedness implies weak connectedness, but the converse
is not necessarily true.
Example: The graph G is strongly connected. The graph H is connected but not
strongly connected (there is no path from a to b).

Figure: Rosen, p. 686


H.-T. Nguyen Connectivity 29/05/2020 15 / 16
Strongly connected component
Definition
A strongly connected component of a directed graph G is a maximal strongly
connected subgraph of G.

Example:
The graph G has one strongly connected component which is itself.
The graph H has three strongly connected components, which are the
subgraphs induced by the sets of vertices {a} , {e} , {b, c, d}.

Figure: Rosen, p. 686

H.-T. Nguyen Connectivity 29/05/2020 16 / 16

You might also like