0% found this document useful (0 votes)
598 views40 pages

Cut-Sets and Cut-Vertices

Uploaded by

devdoshi12345
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
0% found this document useful (0 votes)
598 views40 pages

Cut-Sets and Cut-Vertices

Uploaded by

devdoshi12345
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/ 40

Cut-sets and cut-vertices

Cut-set
• In a connected graph G, a cut-set (cocycle) is a set of edges whose
removal from G leaves G disconnected.
Cut-sets are
{a,c,d,f}, {a,b,g},
{a,b,e,f} and
{d,h,f}. What
about edge {k} ?
{a,c,h,d} is not a
cut-set because
one of its proper
subset {a,c,h} is a
cut-set.
• To emphasize the fact that no proper subset of a cut-set can be a
cut-set, the cut-set is referred as a minimal cut-set, a proper cut-set
or a simple cut-set.
• The cut-set always cuts the graph into two. It is defined as a
minimal set of edges in a connected graph whose removal reduces
the rank of the graph by one.
• Rank of the graph in Fig. 4.1(b) is _________ which is less than that of
graph in 4.1 (a) _________ .
• Another way of looking at a cut-set is : if we partition all the
vertices of a connected graph G into two mutually exclusive
subsets, a cut-set is a minimal number of edges whose removal
from G destroys all paths between these two sets of vertices.
• True or False: every edge of a tree is a cut-set.
• Applications: communication and transportation networks, which
help to identify the bottleneck of the network.
Properties of a cut-set
• Consider a spanning tree T in a connected graph G and an
arbitrary cut-set S in G.
• Is it possible for S not to have any edge in common with T?
• No, otherwise removal of the cut-set S from G would not
disconnect the graph.
• Theorem 4.1: Every cut-set in a connected graph G must contain
at least one branch of every spanning tree G.
• Will the converse also be true? That is, will any minimal set of
edges containing at least one branch of every spanning tree be a
cut-set?
• Answer is: Yes
• Prove.
• Theorem 4.2: In a connected graph G, any minimal set of edges
containing at least one branch of every spanning tree of G is a cut-
set.
• Theorem 4.3: Every circuit has an even number of edges in
common with any cut-set.
All cut-sets in a graph
• Cut-sets are used to identify weak spots in a communication net.
• This requires to list all cut-sets of the corresponding graph, and
find which ones have the smallest number of edges.
• There are large number of cut-sets in a small graph, like 4.1, which
requires a systematic method of generating all relevant cut-sets.
• How to find the circuits in a graph?

• The strategy to find cut-sets is same.


• Just as a spanning tree is essential for defining a set of
fundamental circuits, it is also essential for a set of fundamental
cut-sets.
Fundamental cut-sets
• Consider a spanning tree T of a connected graph G. Take any
branch b in T. Since {b} is a cut-set in T, {b} partitions all vertices of
T into two disjoint sets – one at each end of b. Consider the same
partition of vertices in G, and the cut-set S in G that corresponds to
this partition.
• Cut-set S will contain only one branch b of T, and the rest (if any)
of the edges in S are chords with respect to T. Such a cut-set S
containing exactly one branch of a tree T is called a fundamental
cut-set (basic cut-set) with respect to T.
• Just as every chord of a spanning tree defines a unique fundamental
circuit, every branch of a spanning tree defines a unique fundamental
cut-set.
• The fundamental cut-set has meaning only with respect to a given
spanning tree.
How to obtain other cut-sets from a given
set of cut-sets.
• Theorem 4.4: The ring sum of any two cut-sets in a graph is either
a third cut-set or an edge disjoint union of cut-sets.
Example
• We cannot start with any two cut-sets in a given graph and obtain
all its cut-sets by this method.
• What is a minimal set of cut-sets from which we can obtain every
cut-set of G by taking ring sum? – Answer: set of all fundamental
cut-sets with respect to a given spanning tree.
Fundamental Circuits and Cut-sets
• Consider a spanning tree T in a given connected graph G. Let ci be a
chord with respect to T, and let the fundamental circuit made by ci
be called Γ, consisting of k branches b1, b2, …, bk in addition to the
chord ci, that is
Γ = {ci, b1, b2, …, bk } is a fundamental circuit with respect to T.
• Every branch of any spanning tree has a fundamental cut-set
associated with it. Let S1, be the fundamental cut-set associated
with b1, consisting of q chords in addition to the branch b1, that is
S1 = {b1, c1, c2, … , Cq} is a fundamental cut-set with respect to T.
• According to theorem 4.3, there must be an even number of edges
common to Γ and S1, and there is only one other edge in Γ (which
is ci) that can possibly also be in S1.
• Therefore, there must be two edges b1 and ci common to Γ and S1.
Thus, the chord ci is one of the chords c1, c2, … , cq.
• The same argument holds for fundamental cut-sets associated
with b2, b3,…, bk. Therefore, the chord ci is contained in every
fundamental cut-set associated with branches of Γ.
• Is it possible for the chord ci to be in any other fundamental cut-
set S’ ( with respect to T) besides those associated with b1, b2, …,
b k?
• Answer: No
• Otherwise (since none of the branches in Γ are in S’), there would
be only one edge ci common in S1 and Γ, a contradiction to
Theorem 4.3.
• Theorem 4.5: With respect to a given spanning tree T, a chord ci,
that determines a fundamental circuit Γ occurs in every
fundamental cut-set associated with the branches in Γ and in no
other.
Example
• Consider the spanning tree
{b,c,e,h,k} and the
fundamental circuit made by
chord f is {f,e,h,k}.
• The three fundamental cut-
sets determined by the three
branches e, h and k are:

Chord f occurs in each of these three fundamental cut-sets, and there is


no other fundamental cut-set that contains f.
• The converse of Theorem 4.5 is also true.
• Theorem 4.6: With respect to a given spanning tree T, a branch bi
that determines a fundamental cut-set S is contained in every
fundamental circuits associated with the chords in S, and in no
other.
• Self study: Proof of Theorem 4.6.
Connectivity and Separability
• Edge Connectivity: Each cut-set of a connected graph G consists of
a certain number of edges. The number of edges in the smallest
cut-set (cut-set with fewest number of edges) is defined as the
edge connectivity of G. In other words, the edge connectivity of a
connected graph can be defined as the minimum number of edges
whose removal reduces the rank of the graph by one.
• The edge connectivity of a tree is one.
• Vertex connectivity: Vertex connectivity of a connected graph G is
defined as the minimum number of vertices whose removal from G
leaves the remaining graph disconnected.
• The vertex connectivity of a tree is one.
• The vertex connectivity is meaningful only for graphs that have
three or more vertices and are not complete.
• Note: The edge and vertex connectivity of a disconnected graph is
zero.
• What is the vertex connectivity of a complete graph with 5
vertices?
Edge and vertex connectivity Examples
Separable Graph:
Two graphs with 8 vertices and 16 edges
• What is the highest vertex and edge connectivity we can achieve
for a graph with n vertices and e edges?
• Theorem 4.8: The edge connectivity of a graph G cannot exceed
the degree of the vertex with the smallest degree in G.

• Theorem 4.9: The vertex connectivity of any graph G can never


exceed the edge connectivity of G.
• COROLLARY: Every cut-set in a nonseparable graph with more
than two vertices contains at least two edges.
• Theorem 4.10: The maximum vertex connectivity one can achieve
with a graph G on n vertices and e edges (e≥ n-1) is the integral
2𝑒
part of the number 2e/n ; .
𝑛
• K-connected graph: A graph G is said to be k-connected if the
vertex connectivity of G is k.
• Is a 1-connected graph is the same as a separable graph?
• Theorem 4.11: A graph G is k-connected if and only if every pair
of vertices in G is joined by k or more paths that do not intersect
and at least one pair of vertices is joined by exactly k
nonintersecting paths.
• Theorem 4.12: The edge connectivity of a graph G is k if and only
if every pair of vertices in G is joined by k or more edge-disjoint
paths, and at least one pair of vertices is joined by exactly k edge
disjoint paths.
Network Flow
• Assumptions
• At each intermediate vertex the total rate of commodity entering is equal
to the rate of leaving.
• The flow through a vertex is limited only by the capacities of the edges
incident on it.
• Lines(edges) are lossless.
• Questions
• What is the maximum flow possible through the network between a
specified pair of vertices?
• How do we achieve this flow?
• A cut-set with respect to a pair of vertices a and b in a connected
graph G puts a and b into two different components.
• The capacity of a cut-set S in a weighted connected graph G (in
which the weight of each edge represents its flow capacity) is
defined as the sum of the weights of all the edges in S.
• Theorem 4.13: The maximum flow possible between two vertices
a and b in a network is equal to the minimum of the capacities of
all cut-sets with respect to a and b.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy