Abstract
The problem of determining a maximum matching or whether there exists a perfect matching, is very common in a large variety of applications and as been extensively studied in graph theory. In this paper we start to introduce a characterisation of a family of graphs for which its stability number is determined by convex quadratic programming. The main results connected with the recognition of this family of graphs are also introduced. It follows a necessary and sufficient condition which characterise a graph with a perfect matching and an algorithmic strategy, based on the determination of the stability number of line graphs, by convex quadratic programming, applied to the determination of a perfect matching. A numerical example for the recognition of graphs with a perfect matching is described. Finally, the above algorithmic strategy is extended to the determination of a maximum matching of an arbitrary graph and some related results are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I.M. Bomze, (1998), On standard quadratic optimization problems. Journal of Global Optimization 13: 369-387.
Cvetkovic, D., Doob, M. and Sachs, H., (1979), Spectra of Graphs-Theory and Applications. Academic Press, New York.
Doob, M. (1973), An interrelation between line graphs, eigenvalues, and matroids. Journal of Combinatorial Theory, B 15: 40-50.
Edmonds, J.R. (1965), Paths, trees and flowers. Canadian Journal of Mathematics, 17: 449-467.
Gibbons, L.E., Hearn, D.W., Pardalos, P.M. and Ramana, M.V., (1997), Continuous characterizations of the maximum clique problem. Mathematical Methods of Operations Research 22: 754-768.
Las Vergnas, M. (1975), A note on matchings in graphs. Colloque sur la Théorie des Graphes (Paris, 1974). Cahiers Centre Études Recherche Opérationnelle 17: 257-260.
Lovász, L. and Plummer, M.D. (1986), Matching theory. Annals of Discrete Mathematics, 29. North-Holland, Amsterdam.
Luz, C.J. (1995), An upper bound on the independence number of a graph computable in polynomial time. Operations Research Letters 18: 139-145.
Luz, C.J. and Cardoso, D.M. (1998), A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph. Annals of Operations Research 81: 307-309.
Motzkin, T.S. and Straus, E.G. (1965), Maxima for graphs and a new proof of a theorem of Turán. Canadian Journal of Mathematics, 17: 533-540.
Pulleyblank, W.R. (1995), Matchings and Extensions. In Graham, R.L. Grotschel M. and Lovász, L. (eds), Handbook of Combinatorics. vol. I, pages 180-232. North-Holland, Amsterdam. Lozin, V.V. and Cardoso, D.M. (1999), On hereditary properties of the class of graphs with quadratic stability number. Cadernos de Matemática, CM/I-50, Departamento de Matemática da Universidade de Aveiro. Minty, G.J. (1980), On maximal independent sets of vertices in claw-free graphs. Journal of Combinatory Theory, B 28: 284-304. Sbihi, N. (1980), Algorithm de recherche dun stable de cardinalité maximum dans un graphe sans etoile. Discrete Mathematics, 29: 53-76.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cardoso, D.M. Convex Quadratic Programming Approach to the Maximum Matching Problem. Journal of Global Optimization 19, 291–306 (2001). https://doi.org/10.1023/A:1011276123981
Issue Date:
DOI: https://doi.org/10.1023/A:1011276123981