Geodesic
On a countable family of boundary graph classes for~the~dominating set problem
Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 1, pp. 28-39.

Voir la notice de l'article provenant de la source Math-Net.Ru

The hereditary class is a set of simple graphs closed under deletion of vertices; every such class is defined by the set of its minimal forbidden induced subgraphs. If this set is finite, then it is called finitely defined. The concept of a boundary class is a useful tool for analysis of the computational complexity of graph problems in the finitely defined classes family. The dominating set problem for a given graph is to determine whether it has a given-size subset of vertices such that every vertex outside the subset has at least one neighbor in the subset. Previously, exactly 4 boundary classes were known for this problem (if $\mathbb{P}\neq \mathbb{NP}$). This work considers some countable set of concrete classes of graphs and proves that each its element is a boundary class for the dominating set problem (if $\mathbb{P}\neq \mathbb{NP}$). We also prove $\mathbb{NP}$-completeness of this problem for graphs that contain neither induced 6-path nor induced 4-clique, which means that the set of known boundary classes for the dominating set problem is not complete (if $\mathbb{P}\neq \mathbb{NP}$). Bibliogr. 11.
Keywords: hereditary graph class, computational complexity, dominating set. 
@article{DA_2023_30_1_a1,
     author = {G. S. Dakhno and D. S. Malyshev},
     title = {On a countable family of boundary graph classes for~the~dominating set problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {28--39},
     publisher = {mathdoc},
     volume = {30},
     number = {1},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2023_30_1_a1/}
}
TY  - JOUR
AU  - G. S. Dakhno
AU  - D. S. Malyshev
TI  - On a countable family of boundary graph classes for~the~dominating set problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2023
SP  - 28
EP  - 39
VL  - 30
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2023_30_1_a1/
LA  - ru
ID  - DA_2023_30_1_a1
ER  - 
%0 Journal Article
%A G. S. Dakhno
%A D. S. Malyshev
%T On a countable family of boundary graph classes for~the~dominating set problem
%J Diskretnyj analiz i issledovanie operacij
%D 2023
%P 28-39
%V 30
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2023_30_1_a1/
%G ru
%F DA_2023_30_1_a1
G. S. Dakhno; D. S. Malyshev. On a countable family of boundary graph classes for~the~dominating set problem. Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 1, pp. 28-39. http://geodesic.mathdoc.fr/item/DA_2023_30_1_a1/

[1] Alekseev V. E., Korobitsyn D. V., Lozin V. V., “Boundary classes of graphs for the dominating set problem”, Discrete Math., 285:1–3 (2004), 1–6 | DOI | MR | Zbl

[2] Malyshev D. S., “A complexity dichotomy and a new boundary class for the dominating set problem”, J. Comb. Optim., 32 (2016), 226–243 | DOI | MR | Zbl

[3] Alekseev V. E., “On easy and hard hereditary classes of graphs with respect to the independent set problem”, Discrete Appl. Math., 132:1–3 (2003), 17–26 | DOI | MR | Zbl

[4] Alekseev V. E., Boliac R., Korobitsyn D. V., Lozin V. V., “NP-hard graph problems and boundary classes of graphs”, Theor. Comput. Sci., 389:1–2 (2007), 219–236 | DOI | MR | Zbl

[5] D. V. Korobitsyn, “Complexity of some problems on hereditary classes of graphs”, Diskretn. Mat., 2:3 (1990), 90–96 (Russian) | MR | Zbl

[6] Malyshev D. S., “A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs”, Discrete Appl. Math., 203 (2016), 117–126 | DOI | MR | Zbl

[7] Malyshev D. S., Pardalos P. M., “Critical hereditary graph classes: A survey”, Optim. Lett., 10:8 (2016), 1593–1612 | DOI | MR | Zbl

[8] D. S. Malyshev, “Continued sets of boundary classes of graphs for colorability problems”, Diskretn. Anal. Issled. Oper., 16:5 (2009) (Russian) | MR | Zbl

[9] D. S. Malyshev, “Critical graph classes for the edge list-ranking problem”, J. Appl. Industr. Math., 8:2 (2014), 245–255 | DOI | MR | Zbl

[10] Murphy O. J., “Computing independent sets in graphs with large girth”, Discrete Appl. Math., 35:2 (1992), 167–170 | DOI | MR | Zbl

[11] Müller H., Brandstädt A., “The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs”, Theor. Comput. Sci., 53:2–3 (1987), 257–265 | DOI | MR | Zbl