New polynomial case for efficient domination in $P_6$-free graphs
Abstract
In a graph $G$, an {\it efficient dominating set} is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$. The {\textsc{Efficient Dominating Set}} problem (EDS) asks for the existence of an efficient dominating set in a given graph $G$. The EDS is known to be $NP$-complete for $P_7$-free graphs, and is known to be polynomial time solvable for $P_5$-free graphs. However, the computational complexity of the EDS problem is unknown for $P_6$-free graphs. In this paper, we show that the EDS problem can be solved in polynomial time for a subclass of $P_6$-free graphs, namely ($P_6$, banner)-free graphs.
Read the paper
Related studies
- The Matrisome: In Silico Definition and In Vivo Characterization by Proteomics of Normal and Tumor Extracellular Matrices
- The Escherichia coli MG1655 in silico metabolic genotype: Its definition, characteristics, and capabilities
- In silico pharmacology for drug discovery: methods for virtual ligand screening and profiling
- In silico prediction of splice-altering single nucleotide variants in the human genome
- In silico clinical trials: how computer simulation will transform the biomedical industry
- In silico optimization of a guava antimicrobial peptide enables combinatorial exploration for peptide design
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.