investigates the concepts of maximum-weight graph matching, maximum-cardinality minimum-weight matching for a bipartite graph, determination of minimum cut in a flow network, and construction of automorphs of a cycle graph;