• Citer

Price of Connectivity for the vertex cover problem and the dominating set problem : conjectures and investigation of critical graphs

par Camby, Eglantine
Référence Graphs and combinatorics, 35, 1, page (103–118)
Publication Publié, 2019

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

The vertex cover problem and the dominating set problem are two well-known problems in graph theory. Their goal is to find the minimum size of a vertex subset satisfying some properties. Both hold a connected version, which imposes that the vertex subset must induce a connected component. To study the interdependence between the connected version and the original version of a problem, the Price of Connectivity (PoC) was introduced by Cardinal and Levy (Theor Comput Sci 411(26–28):2581–2590, 2010) and Levy (Approximation algorithms for covering problems in dense graphs. Ph.D. thesis, Université libre de Bruxelles, Brussels, 2009) as the ratio between invariants from the connected version and the original version of the problem. Camby et al. (Discret Math Theor Comput Sci 16:207–224, 2014) for the vertex cover problem, Camby and Schaudt (Discret Appl Math 177:53–59, 2014) for the dominating set problem characterized some classes of PoC-Near-Perfect graphs, hereditary classes of graphs in which the Price of Connectivity is bounded by a fixed constant. Moreover, only for the vertex cover problem, Camby et al. (2014) introduced the notion of critical graphs, graphs that can appear in the list of forbidden induced subgraphs characterization. By definition, the Price of Connectivity of a critical graph is strictly greater than that of any proper induced subgraph. In this paper, we prove that for the vertex cover problem, every critical graph is either isomorphic to a cycle on 5 vertices or bipartite. To go further in the previous studies, we also present conjectures on PoC-Near-Perfect graphs and critical graphs with the help of the computer software GraphsInGraphs (Camby and Caporossi in Studying graphs and their induced subgraphs with the computer: GraphsInGraphs. Cahiers du GERAD G-2016-10, 2016). Moreover, for the dominating set problem, we investigate critical trees and we show that every minimum dominating set of a critical graph is independent.