Czygrinow, Andrzej; Hanćkowiak, Michał; Witkowski, Marcin Distributed distance domination in graphs with no \(K_{2,t}\)-minor. (English) Zbl 07533868 Theor. Comput. Sci. 916, 22-30 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Czygrinow} et al., Theor. Comput. Sci. 916, 22--30 (2022; Zbl 07533868) Full Text: DOI arXiv
Henning, Michael A. Distance domination in graphs. (English) Zbl 1479.05276 Haynes, Teresa W. (ed.) et al., Topics in domination in graphs. Cham: Springer. Dev. Math. 64, 205-250 (2020). MSC: 05C69 05C65 PDFBibTeX XMLCite \textit{M. A. Henning}, Dev. Math. 64, 205--250 (2020; Zbl 1479.05276) Full Text: DOI
Jaffke, Lars; Kwon, O-Joung; Strømme, Torstein J. F.; Telle, Jan Arne Generalized distance domination problems and their complexity on graphs of bounded mim-width. (English) Zbl 1520.05073 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 6, 14 p. (2019). MSC: 05C69 05C12 05C70 68Q27 PDFBibTeX XMLCite \textit{L. Jaffke} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 6, 14 p. (2019; Zbl 1520.05073) Full Text: DOI arXiv
Jaffke, Lars; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne Mim-width. III. Graph powers and generalized distance domination problems. (English) Zbl 1442.05157 Theor. Comput. Sci. 796, 216-236 (2019). MSC: 05C69 05C70 05C12 68Q27 PDFBibTeX XMLCite \textit{L. Jaffke} et al., Theor. Comput. Sci. 796, 216--236 (2019; Zbl 1442.05157) Full Text: DOI
Henning, Michael A.; Lichiardopol, Nicolas Distance domination in graphs with given minimum and maximum degree. (English) Zbl 1381.05051 J. Comb. Optim. 34, No. 2, 545-553 (2017). Reviewer: Baoyindureng Wu (Urumqi) MSC: 05C69 05C12 05C07 05C35 05C40 PDFBibTeX XMLCite \textit{M. A. Henning} and \textit{N. Lichiardopol}, J. Comb. Optim. 34, No. 2, 545--553 (2017; Zbl 1381.05051) Full Text: DOI
Rana, Akul; Pal, Anita; Pal, Madhumangal An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs. (English) Zbl 1495.05321 J. Discrete Math. Sci. Cryptography 19, No. 2, 241-255 (2016). MSC: 05C85 05C69 68W40 PDFBibTeX XMLCite \textit{A. Rana} et al., J. Discrete Math. Sci. Cryptography 19, No. 2, 241--255 (2016; Zbl 1495.05321) Full Text: DOI
Mojdeh, Doost Ali; Sayed-Khalkhali, A.; Abdollahzadeh, Ahangar Hossein; Zhao, Yancai Total \(k\)-distance domination critical graphs. (English) Zbl 1463.05411 Trans. Comb. 5, No. 3, 1-9 (2016). MSC: 05C69 PDFBibTeX XMLCite \textit{D. A. Mojdeh} et al., Trans. Comb. 5, No. 3, 1--9 (2016; Zbl 1463.05411) Full Text: DOI
Dettlaff, Magda; Lemańska, Magdalena; Semanišin, Gabriel; Zuazua, Rita Some variations of perfect graphs. (English) Zbl 1339.05154 Discuss. Math., Graph Theory 36, No. 3, 661-668 (2016). MSC: 05C17 05C69 05C62 PDFBibTeX XMLCite \textit{M. Dettlaff} et al., Discuss. Math., Graph Theory 36, No. 3, 661--668 (2016; Zbl 1339.05154) Full Text: DOI
Zhao, Yancai; Shan, Erfang An efficient algorithm for distance total domination in block graphs. (English) Zbl 1331.05213 J. Comb. Optim. 31, No. 1, 372-381 (2016). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{Y. Zhao} and \textit{E. Shan}, J. Comb. Optim. 31, No. 1, 372--381 (2016; Zbl 1331.05213) Full Text: DOI
Kundu, Sukhamay; Majumder, Subhashis A linear time algorithm for optimal \(k\)-hop dominating set of a tree. (English) Zbl 1346.05285 Inf. Process. Lett. 116, No. 2, 197-202 (2016). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{S. Kundu} and \textit{S. Majumder}, Inf. Process. Lett. 116, No. 2, 197--202 (2016; Zbl 1346.05285) Full Text: DOI
Vaidya, Samir K.; Kothari, Nirang J. Some new results on distance \(k\)-domination in graphs. (English) Zbl 1295.05181 Int. J. Comb. 2013, Article ID 795401, 4 p. (2013). MSC: 05C69 05C12 PDFBibTeX XMLCite \textit{S. K. Vaidya} and \textit{N. J. Kothari}, Int. J. Comb. 2013, Article ID 795401, 4 p. (2013; Zbl 1295.05181) Full Text: DOI
Xu, Jun-Ming On bondage numbers of graphs: a survey with some comments. (English) Zbl 1267.05201 Int. J. Comb. 2013, Article ID 595210, 34 p. (2013). MSC: 05C69 PDFBibTeX XMLCite \textit{J.-M. Xu}, Int. J. Comb. 2013, Article ID 595210, 34 p. (2013; Zbl 1267.05201) Full Text: DOI arXiv
Chellali, Mustapha; Favaron, Odile; Hansberg, Adriana; Volkmann, Lutz \(k\)-domination and \(k\)-independence in graphs: A survey. (English) Zbl 1234.05174 Graphs Comb. 28, No. 1, 1-55 (2012). MSC: 05C69 05-02 PDFBibTeX XMLCite \textit{M. Chellali} et al., Graphs Comb. 28, No. 1, 1--55 (2012; Zbl 1234.05174) Full Text: DOI
Pushpalatha, A. P.; Suganthi, S.; Jothilakshmi, G.; Swaminathan, V. Strong non split \(r\)-domination number of a graph. (English) Zbl 1267.05197 Balakrishnan, R. (ed.) et al., International conference on graph theory and its applications. Papers from the conference, Coimbatore, India, December 11–13, 2008. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 33, 51-57 (2009). MSC: 05C69 PDFBibTeX XMLCite \textit{A. P. Pushpalatha} et al., Electron. Notes Discrete Math. 33, 51--57 (2009; Zbl 1267.05197) Full Text: DOI
Liao, Chung-Shou; Zhang, Louxin Approximating the spanning \(k\)-tree forest problem. (English) Zbl 1248.68562 Deng, Xiaotie (ed.) et al., Frontiers in algorithmics. Third international workshop, FAW 2009, Hefei, China, June 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02269-2/pbk). Lecture Notes in Computer Science 5598, 293-301 (2009). MSC: 68W25 68R10 PDFBibTeX XMLCite \textit{C.-S. Liao} and \textit{L. Zhang}, Lect. Notes Comput. Sci. 5598, 293--301 (2009; Zbl 1248.68562) Full Text: DOI
Xu, Junming; Tian, Fang; Huang, Jia Distance irredundance and connected domination numbers of a graph. (English) Zbl 1113.05079 Discrete Math. 306, No. 22, 2943-2953 (2006). Reviewer: Reinhardt Euler (Brest) MSC: 05C69 PDFBibTeX XMLCite \textit{J. Xu} et al., Discrete Math. 306, No. 22, 2943--2953 (2006; Zbl 1113.05079) Full Text: DOI
Raczek, Joanna; Lemańska, Magdalena; Cyman, Joanna Lower bound on the distance \(k\)-domination number of a tree. (English) Zbl 1150.05312 Math. Slovaca 56, No. 2, 235-243 (2006). MSC: 05C05 05C12 05C69 PDFBibTeX XMLCite \textit{J. Raczek} et al., Math. Slovaca 56, No. 2, 235--243 (2006; Zbl 1150.05312) Full Text: EuDML
Li, Shougui On connected \(k\)-domination numbers of graphs. (English) Zbl 1035.05065 Discrete Math. 274, No. 1-3, 303-310 (2004). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 PDFBibTeX XMLCite \textit{S. Li}, Discrete Math. 274, No. 1--3, 303--310 (2004; Zbl 1035.05065) Full Text: DOI
Comelas, Francesc; Ozón, Javier On the universality of small-world graphs. (English) Zbl 1171.05435 Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 84-87 (2001). MSC: 05C99 PDFBibTeX XMLCite \textit{F. Comelas} and \textit{J. Ozón}, Electron. Notes Discrete Math. 10, 84--87 (2001; Zbl 1171.05435) Full Text: DOI
Henning, Michael A. Packing in trees. (English) Zbl 0957.05090 Discrete Math. 186, No. 1-3, 145-155 (1998). MSC: 05C70 05C05 PDFBibTeX XMLCite \textit{M. A. Henning}, Discrete Math. 186, No. 1--3, 145--155 (1998; Zbl 0957.05090) Full Text: DOI
Fricke, Gerd H.; Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. An algorithm to find two distance domination parameters in a graph. (English) Zbl 0848.05040 Discrete Appl. Math. 68, No. 1-2, 85-91 (1996). Reviewer: B.Zelinka (Liberec) MSC: 05C35 05C12 05C85 PDFBibTeX XMLCite \textit{G. H. Fricke} et al., Discrete Appl. Math. 68, No. 1--2, 85--91 (1996; Zbl 0848.05040) Full Text: DOI
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C. The diversity of domination. (English) Zbl 0870.05034 Discrete Math. 161, No. 1-3, 161-173 (1996). MSC: 05C35 PDFBibTeX XMLCite \textit{M. A. Henning} et al., Discrete Math. 161, No. 1--3, 161--173 (1996; Zbl 0870.05034) Full Text: DOI
Hattingh, Johannes H.; Henning, Michael A. The ratio of the distance irredundance and domination numbers of a graph. (English) Zbl 0789.05047 J. Graph Theory 18, No. 1, 1-9 (1994). Reviewer: O.R.Oellermann (Killarney) MSC: 05C35 05C05 PDFBibTeX XMLCite \textit{J. H. Hattingh} and \textit{M. A. Henning}, J. Graph Theory 18, No. 1, 1--9 (1994; Zbl 0789.05047) Full Text: DOI