Author/Authors :
and that image for any connected bipartite graph with image support vertices. Moreover، نويسنده , , B) is said to have positive surplus (as viewed from A) if the number of neighbors of X is bigger than the size of X for any non-empty subset X of A. In this paper، نويسنده , , two lower bounds on the number of maximum matchings in bipartite graphs with positive surplus are obtained. The enumeration problems for maximum matchings in special bipartite graphs are solved. From this، نويسنده , , the number of perfect matchings of some elementary bipartite graphs is given.، نويسنده ,
