Scribd
Upload
8 views3 pages

TUTORIAL 6 - Solution

The document discusses properties of connected graphs, specifically regarding cut-sets and spanning trees, and defines cut-vertices. It also explores the edge connectivity of complete graphs and provides a solution for organizing a fair singles tennis tournament using graph theory principles. Key strategies include ensuring graph connectivity, even distribution of matches, and preventing isolated subgroups among players.

Uploaded by

asmit mishra
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
8 views3 pages

TUTORIAL 6 - Solution

The document discusses properties of connected graphs, specifically regarding cut-sets and spanning trees, and defines cut-vertices. It also explores the edge connectivity of complete graphs and provides a solution for organizing a fair singles tennis tournament using graph theory principles. Key strategies include ensuring graph connectivity, even distribution of matches, and preventing isolated subgroups among players.

Uploaded by

asmit mishra
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/ 3

TUTORIAL 6 - SOLUTION

1. Prove that in a connected graph G the complement of a cut-set in G does not contain a
spanning tree and the complement of a spanning tree (i.e., chord set) does not contain a
cut-set.
1. Complement of a cut-set does not contain a spanning tree
• A cut-set is a set of edges whose removal disconnects the graph.
• Removing the cut-set from G leaves a disconnected graph.
• A spanning tree must be connected and include all n vertices with n−1 edges.
• Since the remaining edges (i.e., complement of the cut-set) belong to a disconnected
subgraph, they cannot form a spanning tree.
Therefore, the complement of a cut-set cannot contain a spanning tree.

2. Complement of a spanning tree does not contain a cut-set


• A spanning tree connects all vertices with the minimum number of edges (i.e., n−1), and
contains no cycles.
• The complement of the spanning tree consists of edges not in the tree, called chords.
• Since the spanning tree alone connects the graph, removing any subset of the chords cannot
disconnect it.
• Therefore, no subset of the chord set can act as a cut-set.
Hence, the complement of a spanning tree does not contain a cut-set.

2. A vertex v in a connected graph G is a cut-vertex if and only if there exist two vertices x and y
in G such that every path between x and y passes through v.

(⇒) If v is a cut-vertex, then all paths between some x and y go through v:


• A cut-vertex is a vertex whose removal increases the number of connected components of
G; in other words, its removal disconnects the graph.
• Therefore, when v is removed, there must be at least two vertices x and y that end up in
different components.
• This implies that every path between x and y must have gone through v, because once v is
removed, no such path remains.
So, if v is a cut-vertex, then for some x, y, all paths from x to y must pass through v.

(⇐) If every path between x and y passes through v, then v is a cut-vertex:


• Assume there exist vertices x and y in G such that every path between them passes through
v.
• Remove v from the graph.
• Since all paths between x and y passed through v, now there is no path between x and y.
• That means the graph has become disconnected after removing v, which satisfies the
definition of a cut-vertex.
• So, v must be a cut-vertex.

3. What is the edge connectivity of the complete graph of n vertices?


n – 1, since each vertex has degree n−1
4. Prove that in a connected graph G a vertex v is a cut-vertex if and only if there exist two (or
more) edges x and y incident on v such that no circuit in G includes both x and y.

Proof
We will prove the statement in both directions:

(⇒) If v is a cut-vertex, then there exist two edges x and y incident on v such that no circuit
includes both.
• Suppose v is a cut-vertex.
• Removing v disconnects the graph into at least two components.
• Let e1=vu1 and e2=vu2 be two edges incident on v, where u1 and u2 lie in different
components after removing v.
• Any circuit including both e1 and e2 must connect u1 and u2 without going through v again
after removal—but this is impossible, because u1 and u2 are disconnected without v.
• Thus, no circuit can contain both e1 and e2.
Hence, such edges x=e1 and y=e2 exist.

(⇐) If there exist two edges x and y incident on v such that no circuit contains both, then v
is a cut-vertex.
• Suppose x=vu1 and y=vu2, and no circuit in G contains both.
• This implies that the only way to go from u1 to u2 is through v, and there's no alternative
cycle.
• Suppose we remove v from G. Then:
o All paths between u1 and u2 are broken.
o G becomes disconnected, as there's no path between u1 and u2 without v.
• Hence, v is a cut-vertex.
Therefore, the absence of a circuit containing both edges forces v to be a point of
articulation.

5. Suppose that a singles tennis tournament is to be arranged among n players and the number
of matches planned is a fixed number e (where n− 1 < e < n(n − l)/2). For the sake of fairness,
how will you make sure that some players do not group together and isolate an individual
(or a small group of players)?

Solution :

1. Model the tournament as a graph:

o Each player is a vertex.

o Each match is an edge connecting two players.

2. Ensure the graph is connected:

o At minimum, the graph must be connected so that no player is completely isolated.

o This requires at least n−1 matches.

3. Distribute matches evenly:


o Each player should have a similar number of matches (degree), ideally close to 2e/n,
to avoid imbalance.

4. Prevent cliques or isolated subgroups:

o No subset of players should only play among themselves.

o Ensure that every subset of players has edges (matches) connecting them to players
outside the group.

5. Use graphs with edge connectivity ≥ 2:

o The graph should remain connected even if any single match is removed.

o This helps prevent manipulation or isolation by a group.

6. Avoid highly unbalanced graphs:

o Don’t schedule all matches around a few central players.

o Ensure everyone has a chance to interact competitively with different players.

7. Use structured or randomized scheduling:

o Balanced designs like regular graphs or random graphs with enough edges can
ensure fairness and coverage.

By following these principles, the tournament will be fair, and no group of players can isolate or gang
up on others.

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