Sesión Matemática DiscretaKE-index
Daniel Alejandro Jaume
Universidad Nacional de San Luis -- IMASL -- CONICET, Argentina - Esta dirección de correo electrónico está siendo protegida contra los robots de spam. Necesita tener JavaScript habilitado para poder verlo.
In this work, we introduce the KE-index. The KE-index of a graph is defined as the difference between the vertex covering number and the matching number of the graph. This number measures, in some sense, how far a graph is from being a K\H{o}nig-Egerv\'{a}ry graph. We present several properties of the KE-index and demonstrate that various statements involving K\H{o}nig-Egerv\'{a}ry graphs are, in fact, general statements about graphs when considered in terms of the KE-index. We also provide lower and upper bounds for the K\H{o}nig Deletion Problem.
Trabajo en conjunto con: Gonzalo Molina (Universidad Nacional de San Luis).