Perfecting matching of an undirected dense based on geometric multiplicity.

One of the important concepts of Graph Theory is Matching Theory. Several Concepts on Matching Theory has been dealt in [1, 2, 3]. The technique of maximum matching on directed graphs have been studied in [1]. In this paper, a new approach for finding maximum matching of an undirected dense graph based on largest geometric multiplicity of Eigen values using exact controllability network is studied. It will be interest to further study on their properties. [ABSTRACT FROM AUTHOR]