A characterization of the weighted Lovász number based on convex quadratic programming
- 174 Downloads
Luz and Schrijver (SIAM J Discrete Math 19(2):382–387, 2005) introduced a characterization of the Lovász number based on convex quadratic programming. This characterization is now extended to the weighted version of that number. In consequence, a class of graphs for which the weighted Lovász number coincides with the weighted stability number is characterized. Several examples of graphs of this class are presented.
KeywordsWeighted Lovász number Maximum weight stable set Combinatorial optimization Graph theory Quadratic programming
The author thanks the referees for their helpful comments and suggestions which improved the paper. This research was supported by Portuguese funds through the Center for Research and Development in Mathematics and Applications (CIDMA) and the Portuguese Foundation for Science and Technology (“FCT—Fundação para a Ciência e Tecnologia”), within project UID/MAT/04106/2013.
- 4.Cardoso, D.M., Luz, C.J.: A simplex like approach based on star set for recognizing convex-\(QP\) adverse graphs. J. Comb. Optim. (2014). doi: 10.107/s10870-014-9745-x
- 6.DIMACS: Cliques, coloring, and satisfiability: second dimacs implementation challenge. http://dimacs.rutgers.edu/Challenges/ (1995)
- 10.Knuth, D.E.: The sandwich theorem. Electron. J. Comb. 1, 1–48, Article #A1 (1994)Google Scholar