On the Number of
$$
k
$$-Dominating Independent Sets in Planar Graphs
-
Published:2024-03
Issue:1
Volume:18
Page:167-178
-
ISSN:1990-4789
-
Container-title:Journal of Applied and Industrial Mathematics
-
language:en
-
Short-container-title:J. Appl. Ind. Math.
Publisher
Pleiades Publishing Ltd
Reference15 articles.
1. Z. L. Nagy, “On the number of
$$
k
$$-dominating independent sets,” J. Graph Theory 84 (4), 566–580 (2017).
2. D. Gerbner, B. Keszegh, A. Methuku, B. Patk’os, and M. Vizer, “An
improvement on the maximum number of
$$
k
$$-dominating independent sets,” J. Graph Theory 91 (1), 88–97 (2019).
3. J. Moon and L. Moser, “On cliques in graphs,” Israel J. Math. 3 (1), 23–28 (1965).
4. D. R. Wood, “On the number of maximal independent sets in a graph,”
Discrete Math. Theor. Comput. Sci. 13 (3), 17–19
(2011).
5. J. Griggs, C. Grinstead, and D. Guichard, “The number of maximal
independent sets in a connected graph,” Discrete Math. 68, 211–220 (1988).