7th meeting

Component
• A subgraph H of a graph G is a component of
G if H is a maximal connected subgraph of G.
• We denote the number of components of a
graph G by k(G).
• Therefore, a graph G is connected if only if
k(G) = 1.
 G
• k(G) = 4
• Since k(G) = 4 then G is disconnected
 Cut-vertices
• A vertex v in a graph G is called a cut-vertex if
k(G-v) > k (G). So, v is a cut-vertex in a
connected graph G if G – v is disconnected.
 Bridges
• An edge e in a graph G is called a bridge if
k (G – e) > k (G). Therefore an edge e in a
connected graph G is a bridge if G – e is
disconnected.
 theorem
• An edge e of a connected graph G is a bridge
of G if and only if e does not lie on a cycle of
G
 Nonseparable Graph, Block, End-
Block
• A nontrivial connected graph without a cut-
vertex is called a nonseparable graph.
• Let G be a nontrivial connected graph. A block
B of G is a subgraph of G that is itself a
nonseparable graph and that is maximal with
respect to this property.
• A block of a graph G that contains exactly one
cut-vertex of G is called an end-block of G.
 v1 v2

v3

v4 v5

G1 v6

G2
v1 v2

v3
v1 v2

v3

v4 v5

G3
 Tree
• Tree is a connected graph without cycles.
 Exercise
1. Find all cut-vertices and bridges in the graph
G shown below.

2. Give an example of connected graph G

containing a vertex v such that G – v has five
components.
3. Give an example graph G that has 5 blocks
4. Give an example graph G that has end-block
5. Draw a tree of order 5.