Title of article

Number of maximum matchings of bipartite graphs with positive surplus

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.، نويسنده ,

Issue Information

روزنامه با شماره پیاپی سال 2004

Pages

From page

311

To page

318

Abstract

Yan Liu, Guizhen Liu

Keywords

Maximum Matching , Bipartite graph with positive surplus , Elementary graph

Journal title

Discrete Mathematics

Serial Year

2004

Journal title

Discrete Mathematics

Record number

Link To Document