Maximum matchings of a digraph based on the largest geometric multiplicity

Abstract EN

Matching theory is one of the most forefront issues of graph theory.

Based on the largest geometric multiplicity, we develop an efficient approach to identify maximum matchings in a digraph.

For a given digraph, it has been proved that the number of maximum matched nodes has close relationship with the largest geometric multiplicity of the transpose of the adjacency matrix.

Moreover, through fundamental column transformations, we can obtain the matched nodes and related matching edges.

In particular, when a digraph contains a cycle factor, the largest geometric multiplicity is equal to one.

In this case, the maximum matching is a perfect matching and each node in the digraph is a matched node.

The method is validated by an example.