Scribd
Upload
6 views

CSC307 Graph Theory File 02

The document contains solutions to various problems related to graph theory, specifically focusing on concepts such as matchings, maximum and complete matchings, and perfect matchings in bipartite graphs. It outlines definitions and examples, including the significance of matchings in job assignments. Additionally, it presents problems related to creating bipartite graphs and properties of regular bipartite graphs.

Uploaded by

ahmadchoudhary140693
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
6 views

CSC307 Graph Theory File 02

The document contains solutions to various problems related to graph theory, specifically focusing on concepts such as matchings, maximum and complete matchings, and perfect matchings in bipartite graphs. It outlines definitions and examples, including the significance of matchings in job assignments. Additionally, it presents problems related to creating bipartite graphs and properties of regular bipartite graphs.

Uploaded by

ahmadchoudhary140693
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/ 89

CSC307-Graph Theory

File 02

Dr. Muhammad Naeem


Solution 2.1
Solution 2.2
Solution 2.4
Solution 2.5
Solution 2.6
Solution 2.10
Another form of this lemma is in the next slide.
Solution 2.11
Solution 2.13
Solution 2.15
Solution 2.16
Solution 2.17
Solution 2.18
Solution 2.20
Solution 2.21
Solution 2.22

Solution 2.23
Solution (C)
Matching
Finding an assignment of jobs to employees can be thought of
as finding a matching in the graph model, where a matching
M in a simple graph G = (V, E) is a subset of the set E of edges
of the graph such that no two edges are incident with the
same vertex. In other words, a matching is a subset of edges
such that if {s, t} and {u, v} are distinct edges of the matching,
then s, t, u, and v are distinct.
Maximum and Complete Matching
A vertex that is the endpoint of an edge of a matching M is said to be
matched in M; otherwise it is said to be unmatched. A maximum
matching is a matching with the largest number of edges. We say that a
matching M in a bipartite graph G = (V, E) with bipartition (𝑉1 , 𝑉2 ) is a
complete matching from 𝑉1 to 𝑉2 if every vertex in 𝑉1 is the
endpoint of an edge in the matching, or equivalently, if
|𝑀| = 𝑉1 . For example, to assign jobs to employees so that the largest
number of jobs are assigned employees, we seek a maximum matching
in the graph that models employee capabilities. To assign employees to
all jobs we seek a complete matching from the set of jobs to the set of
employees.
Perfect Matching
A perfect matching is one in which all vertices of the
graph are incident with exactly one edge in the
matching.
Problem
1. What is the smallest number of edges that can be removed
from 𝐾5 to create a bipartite graph.
2. Show that if G is a regular bipartite graph, and the common degree
of the vertices is at least 1, then the two parts are the same size.
3. Show that a regular bipartite graph with common degree at least 1
has a perfect matching.
Solution(only
first part)
Applications

You might also like