Prepared by:
Joseph Malkevitch
Department of Mathematics and Computer Studies
York College (CUNY)
Jamaica, New York 11451
email: joeyc@cunyvm.cuny.edu
web page: http://www.york.cuny.edu/~malk
1. For the complete graphs on 4 vertices below, find the matching of minimum total cost. The cost of a matching is the sum of the weights on the edges of the matching.
2. For the complete bipartite graph on 6 vertices below, find the matching of minimum total cost.
