Year: 2024
Type: article
Abstract: A pendant vertex is one of degree one and an isolated vertex has degree zero. A neighborhood star-free (NSF for short) graph is one in which every vertex is contained in a triangle except pendant vertices and isolated vertices. This class has been considered before for several contexts. In the present paper, we study the complexity of the dominating induced matching (DIM) problem and the perfect edge domination (PED) problem for NSF graphs. We prove the corresponding decision problems are NP-Complete for several of its subclasses. As an added value of this study, we show three connected variants of planar positive 1in3SAT are also NP-Complete. Since these variants are more basic in complexity theory context than many graph problems, these results can be useful to prove that other problems are NP-Complete.
Source: RAIRO - Operations Research
DOI: 10.1051/ro/2024198
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funders: Consejo Nacional de Investigaciones Científicas y Técnicas, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro, Universidad de Buenos Aires, Fundação Coordenação de Projetos, Pesquisas e Estudos Tecnológicos, Secretaria de Ciencia y Tecnica, Universidad de Buenos Aires, Secretaría de Ciencia y Técnica, Universidad de Buenos Aires, Universidad Nacional de General Sarmiento
OpenAlex ID: W4403509418