Sudhahar, P. Arul Paul; Umamaheswari, R. The connected total restrained geodetic domination number of a graph. (English) Zbl 07303978 J. Adv. Math. Stud. 13, No. 3, 350-358 (2020). MSC: 05C69 PDF BibTeX XML Cite \textit{P. A. P. Sudhahar} and \textit{R. Umamaheswari}, J. Adv. Math. Stud. 13, No. 3, 350--358 (2020; Zbl 07303978) Full Text: Link
Validi, Hamidreza; Buchanan, Austin The optimal design of low-latency virtual backbones. (English) Zbl 07303816 INFORMS J. Comput. 32, No. 4, 952-967 (2020). MSC: 90B18 90C05 90C35 90C57 PDF BibTeX XML Cite \textit{H. Validi} and \textit{A. Buchanan}, INFORMS J. Comput. 32, No. 4, 952--967 (2020; Zbl 07303816) Full Text: DOI
Yao, Xiaopeng; Huang, Hejiao; Du, Hongwei Connected positive influence dominating set in \(k\)-regular graph. (English) Zbl 1448.05156 Discrete Appl. Math. 287, 65-76 (2020). MSC: 05C69 05C40 PDF BibTeX XML Cite \textit{X. Yao} et al., Discrete Appl. Math. 287, 65--76 (2020; Zbl 1448.05156) Full Text: DOI
Chen, Xiuyang; Zhang, Zhao A game theoretic approach for minimal connected dominating set. (English) Zbl 07239078 Theor. Comput. Sci. 836, 29-36 (2020). MSC: 05C69 05C57 05C40 91A43 PDF BibTeX XML Cite \textit{X. Chen} and \textit{Z. Zhang}, Theor. Comput. Sci. 836, 29--36 (2020; Zbl 07239078) Full Text: DOI
Furuya, Michitaka; Tsuchiya, Shoichi Large homeomorphically irreducible trees in path-free graphs. (English) Zbl 07202762 J. Graph Theory 93, No. 3, 372-394 (2020). MSC: 05C PDF BibTeX XML Cite \textit{M. Furuya} and \textit{S. Tsuchiya}, J. Graph Theory 93, No. 3, 372--394 (2020; Zbl 07202762) Full Text: DOI
Cao, Fayun; Ren, Han Nonseparating independent sets of Cartesian product graphs. (English) Zbl 1434.05106 Taiwanese J. Math. 24, No. 1, 1-17 (2020). MSC: 05C69 05C70 05C76 05C05 05C40 PDF BibTeX XML Cite \textit{F. Cao} and \textit{H. Ren}, Taiwanese J. Math. 24, No. 1, 1--17 (2020; Zbl 1434.05106) Full Text: DOI Euclid
Wang, Limin; Shi, Yalin; Zhang, Zhao; Zhang, Zan-Bo; Zhang, Xiaoyan Approximation algorithm for a generalized Roman domination problem in unit ball graphs. (English) Zbl 1434.05117 J. Comb. Optim. 39, No. 1, 138-148 (2020). MSC: 05C69 90C35 PDF BibTeX XML Cite \textit{L. Wang} et al., J. Comb. Optim. 39, No. 1, 138--148 (2020; Zbl 1434.05117) Full Text: DOI
Khuller, Samir; Purohit, Manish; Sarpatwar, Kanthi K. Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems. (English) Zbl 1436.68399 SIAM J. Discrete Math. 34, No. 1, 251-270 (2020). MSC: 68W25 05C69 05C85 68W40 PDF BibTeX XML Cite \textit{S. Khuller} et al., SIAM J. Discrete Math. 34, No. 1, 251--270 (2020; Zbl 1436.68399) Full Text: DOI
Liu, Xianliang; Yang, Zishen; Wang, Wei Some results for the two disjoint connected dominating sets problem. (English) Zbl 1427.05165 Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950065, 11 p. (2019). MSC: 05C69 PDF BibTeX XML Cite \textit{X. Liu} et al., Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950065, 11 p. (2019; Zbl 1427.05165) Full Text: DOI
Hermelin, Danny; Mnich, Matthias; Van Leeuwen, Erik Jan; Woeginger, Gerhard Domination when the stars are out. (English) Zbl 07136417 ACM Trans. Algorithms 15, No. 2, Article No. 25, 90 p. (2019). MSC: 68R10 05C69 05C75 68Q17 68Q25 68Q27 PDF BibTeX XML Cite \textit{D. Hermelin} et al., ACM Trans. Algorithms 15, No. 2, Article No. 25, 90 p. (2019; Zbl 07136417) Full Text: DOI
Rad, Nader Jafari; Poureidi, Abolfazl On hop Roman domination in trees. (English) Zbl 1438.05195 Commun. Comb. Optim. 4, No. 2, 201-208 (2019). MSC: 05C69 PDF BibTeX XML Cite \textit{N. J. Rad} and \textit{A. Poureidi}, Commun. Comb. Optim. 4, No. 2, 201--208 (2019; Zbl 1438.05195) Full Text: DOI
Kuo, Tung-Wei On the approximability and hardness of the minimum connected dominating set with routing cost constraint. (English) Zbl 1434.68677 Theor. Comput. Sci. 793, 140-151 (2019). MSC: 68W25 05C69 68R10 68W40 PDF BibTeX XML Cite \textit{T.-W. Kuo}, Theor. Comput. Sci. 793, 140--151 (2019; Zbl 1434.68677) Full Text: DOI
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian Lossy kernels for connected dominating set on sparse graphs. (English) Zbl 1430.68195 SIAM J. Discrete Math. 33, No. 3, 1743-1771 (2019). MSC: 68R10 05C69 68Q27 PDF BibTeX XML Cite \textit{E. Eiben} et al., SIAM J. Discrete Math. 33, No. 3, 1743--1771 (2019; Zbl 1430.68195) Full Text: DOI
Raczek, Joanna; Cyman, Joanna Weakly connected Roman domination in graphs. (English) Zbl 1419.05171 Discrete Appl. Math. 267, 151-159 (2019). MSC: 05C69 05C40 05C05 PDF BibTeX XML Cite \textit{J. Raczek} and \textit{J. Cyman}, Discrete Appl. Math. 267, 151--159 (2019; Zbl 1419.05171) Full Text: DOI
Chiarelli, Nina; Milanič, Martin Linear separation of connected dominating sets in graphs. (English) Zbl 1416.05207 Ars Math. Contemp. 16, No. 2, 487-525 (2019). MSC: 05C69 05C40 05C75 05C65 05C85 PDF BibTeX XML Cite \textit{N. Chiarelli} and \textit{M. Milanič}, Ars Math. Contemp. 16, No. 2, 487--525 (2019; Zbl 1416.05207) Full Text: DOI arXiv
Akhbari, M. H.; Movahedi, F.; Arslanov, M. On the doubly connected domination polynomial of a graph. (English) Zbl 1414.05150 Asian-Eur. J. Math. 12, No. 3, Article ID 1950036, 10 p. (2019). MSC: 05C31 05C69 05C40 PDF BibTeX XML Cite \textit{M. H. Akhbari} et al., Asian-Eur. J. Math. 12, No. 3, Article ID 1950036, 10 p. (2019; Zbl 1414.05150) Full Text: DOI
Camby, Eglantine Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs. (English) Zbl 1409.05156 Graphs Comb. 35, No. 1, 103-118 (2019). MSC: 05C70 05-04 05C40 05C35 05C69 PDF BibTeX XML Cite \textit{E. Camby}, Graphs Comb. 35, No. 1, 103--118 (2019; Zbl 1409.05156) Full Text: DOI
Zhou, Jiao; Zhang, Zhao; Tang, Shaojie; Huang, Xiaohui; Du, Ding-Zhu Breaking the \(o(\ln n)\) barrier: an enhanced approximation algorithm for fault-tolerant minimum weight connected dominating set. (English) Zbl 07271635 INFORMS J. Comput. 30, No. 2, 225-235 (2018). MSC: 90C PDF BibTeX XML Cite \textit{J. Zhou} et al., INFORMS J. Comput. 30, No. 2, 225--235 (2018; Zbl 07271635) Full Text: DOI
Zhang, Zhao; Zhou, Jiao; Tang, Shaojie; Huang, Xiaohui; Du, Ding-Zhu Computing minimum \(k\)-connected \(m\)-fold dominating set in general graphs. (English) Zbl 07271634 INFORMS J. Comput. 30, No. 2, 217-224 (2018). MSC: 90C PDF BibTeX XML Cite \textit{Z. Zhang} et al., INFORMS J. Comput. 30, No. 2, 217--224 (2018; Zbl 07271634) Full Text: DOI
Hamann, Heiko; Markarian, Christine; Meyer auf der Heide, Friedhelm; Wahby, Mostafa Pick, pack, & survive: charging robots in a modern warehouse based on online connected dominating sets. (English) Zbl 07229766 Ito, Hiro (ed.) et al., 9th international conference on fun with algorithms, FUN 2018, June 13–15, 2018, La Maddalena Island, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-067-5). LIPIcs – Leibniz International Proceedings in Informatics 100, Article 22, 13 p. (2018). MSC: 68Wxx PDF BibTeX XML Cite \textit{H. Hamann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 100, Article 22, 13 p. (2018; Zbl 07229766) Full Text: DOI
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian Lossy kernels for connected dominating set on sparse graphs. (English) Zbl 07228420 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-062-0). LIPIcs – Leibniz International Proceedings in Informatics 96, Article 29, 15 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 29, 15 p. (2018; Zbl 07228420) Full Text: DOI
Liu, Xianliang; Yang, Zishen; Wang, Wei Algorithm and complexity of the two disjoint connected dominating sets problem on trees. (English) Zbl 1427.68250 Appl. Math. Comput. 337, 419-427 (2018). MSC: 68R10 05C40 05C69 68Q17 68W25 PDF BibTeX XML Cite \textit{X. Liu} et al., Appl. Math. Comput. 337, 419--427 (2018; Zbl 1427.68250) Full Text: DOI
Fukunaga, Takuro Approximation algorithms for highly connected multi-dominating sets in unit disk graphs. (English) Zbl 1414.05224 Algorithmica 80, No. 11, 3270-3292 (2018). MSC: 05C69 05C22 68W25 PDF BibTeX XML Cite \textit{T. Fukunaga}, Algorithmica 80, No. 11, 3270--3292 (2018; Zbl 1414.05224) Full Text: DOI
Bendali, F.; Mailfert, J. The weakly connected independent set polytope in corona and join of graphs. (English) Zbl 1410.05104 J. Comb. Optim. 36, No. 3, 1007-1023 (2018). MSC: 05C40 05C69 05C76 90C57 90C35 PDF BibTeX XML Cite \textit{F. Bendali} and \textit{J. Mailfert}, J. Comb. Optim. 36, No. 3, 1007--1023 (2018; Zbl 1410.05104) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Kernels for (connected) dominating set on graphs with excluded topological minors. (English) Zbl 06976506 ACM Trans. Algorithms 14, No. 1, Article No. 6, 31 p. (2018). MSC: 68Q27 05C10 05C69 68Q17 68R10 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 14, No. 1, Article No. 6, 31 p. (2018; Zbl 06976506) Full Text: DOI
Nutov, Zeev Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems. (English) Zbl 06958572 Inf. Process. Lett. 140, 30-33 (2018). MSC: 68Q PDF BibTeX XML Cite \textit{Z. Nutov}, Inf. Process. Lett. 140, 30--33 (2018; Zbl 06958572) Full Text: DOI
Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket Below all subsets for minimal connected dominating set. (English) Zbl 1396.05052 SIAM J. Discrete Math. 32, No. 3, 2332-2345 (2018). MSC: 05C30 05C69 68Q25 PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., SIAM J. Discrete Math. 32, No. 3, 2332--2345 (2018; Zbl 1396.05052) Full Text: DOI
Mojdeh, D. A.; Emadi, A. S. Connected domination polynomial of graphs. (English) Zbl 1394.05090 Fasc. Math. 60, 103-121 (2018). MSC: 05C69 05C31 PDF BibTeX XML Cite \textit{D. A. Mojdeh} and \textit{A. S. Emadi}, Fasc. Math. 60, 103--121 (2018; Zbl 1394.05090) Full Text: DOI
Li, Hengzhe; Wu, Baoyindureng; Yang, Weihua Making a dominating set of a graph connected. (English) Zbl 1392.05089 Discuss. Math., Graph Theory 38, No. 4, 947-962 (2018). MSC: 05C69 05C40 PDF BibTeX XML Cite \textit{H. Li} et al., Discuss. Math., Graph Theory 38, No. 4, 947--962 (2018; Zbl 1392.05089) Full Text: DOI
Cornet, Alexis; Laforest, Christian Total domination, connected vertex cover and Steiner tree with conflicts. (English) Zbl 1401.05214 Discrete Math. Theor. Comput. Sci. 19, No. 3, Paper No. 17, 15 p. (2017). MSC: 05C69 05C05 05C70 PDF BibTeX XML Cite \textit{A. Cornet} and \textit{C. Laforest}, Discrete Math. Theor. Comput. Sci. 19, No. 3, Paper No. 17, 15 p. (2017; Zbl 1401.05214) Full Text: Link
Wang, Bin; Sun, Defeng A decomposition approach for the minimum connected dominating set problem. (Chinese. English summary) Zbl 1399.90202 J. Shenyang Norm. Univ., Nat. Sci. 35, No. 4, 419-424 (2017). MSC: 90C10 90C35 05C69 90B18 PDF BibTeX XML Cite \textit{B. Wang} and \textit{D. Sun}, J. Shenyang Norm. Univ., Nat. Sci. 35, No. 4, 419--424 (2017; Zbl 1399.90202) Full Text: DOI
Wu, Xinyun; Lü, Zhipeng; Galinier, Philippe Restricted swap-based neighborhood search for the minimum connected dominating set problem. (English) Zbl 1390.90128 Networks 69, No. 2, 222-236 (2017). MSC: 90B10 90B18 05C40 90C59 PDF BibTeX XML Cite \textit{X. Wu} et al., Networks 69, No. 2, 222--236 (2017; Zbl 1390.90128) Full Text: DOI
Bley, Andreas; Ljubić, Ivana; Maurer, Olaf A node-based ILP formulation for the node-weighted dominating Steiner problem. (English) Zbl 1390.90149 Networks 69, No. 1, 33-51 (2017). MSC: 90B18 90C10 PDF BibTeX XML Cite \textit{A. Bley} et al., Networks 69, No. 1, 33--51 (2017; Zbl 1390.90149) Full Text: DOI
Rahu, S. V. Siva Rama; Rao, I. H. Nagaraja Total global neighbourhood domination. (English) Zbl 1388.05142 Algebra Discrete Math. 24, No. 2, 320-330 (2017). MSC: 05C69 PDF BibTeX XML Cite \textit{S. V. S. R. Rahu} and \textit{I. H. N. Rao}, Algebra Discrete Math. 24, No. 2, 320--330 (2017; Zbl 1388.05142)
Yu, Fahong; Xia, Xiaoyun; Li, Wenping; Tao, Jiang; Ma, Longhua; Cai, Zhao-quan Critical node identification for complex network based on a novel minimum connected dominating set. (English) Zbl 1386.05183 Soft Comput. 21, No. 19, 5621-5629 (2017). MSC: 05C82 05C69 05C85 PDF BibTeX XML Cite \textit{F. Yu} et al., Soft Comput. 21, No. 19, 5621--5629 (2017; Zbl 1386.05183) Full Text: DOI
Sun, Peng Gang; Ma, Xiaoke; Chi, Juan Dominating complex networks by identifying minimum skeletons. (English) Zbl 1380.90078 Chaos Solitons Fractals 104, 182-191 (2017). MSC: 90B15 05C82 05C69 PDF BibTeX XML Cite \textit{P. G. Sun} et al., Chaos Solitons Fractals 104, 182--191 (2017; Zbl 1380.90078) Full Text: DOI
Lehner, Florian; Wagner, Stephan Maximizing the number of independent sets of fixed size in connected graphs with given independence number. (English) Zbl 1395.05129 Graphs Comb. 33, No. 5, 1103-1118 (2017). Reviewer: Martin Milanič (Koper) MSC: 05C69 05C35 05C30 05C40 PDF BibTeX XML Cite \textit{F. Lehner} and \textit{S. Wagner}, Graphs Comb. 33, No. 5, 1103--1118 (2017; Zbl 1395.05129) Full Text: DOI
Coelho, Rafael S.; Moura, Phablo F. S.; Wakabayashi, Yoshiko The \(k\)-hop connected dominating set problem: approximation and hardness. (English) Zbl 1384.90081 J. Comb. Optim. 34, No. 4, 1060-1083 (2017). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{R. S. Coelho} et al., J. Comb. Optim. 34, No. 4, 1060--1083 (2017; Zbl 1384.90081) Full Text: DOI
Chaluvaraju, B.; Puttaswamy; Manjunath, N.; Nayaka, S. R. The co-connected domination polynomial of a graph. (English) Zbl 1371.05209 Adv. Appl. Discrete Math. 18, No. 1, 57-70 (2017). MSC: 05C69 PDF BibTeX XML Cite \textit{B. Chaluvaraju} et al., Adv. Appl. Discrete Math. 18, No. 1, 57--70 (2017; Zbl 1371.05209) Full Text: DOI Link
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbcik, Michal; Larsen, Kim S. Online dominating set. (English) Zbl 1378.68196 Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 21, 15 p. (2016). MSC: 68W27 05C40 05C69 05C85 PDF BibTeX XML Cite \textit{J. Boyar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 53, Article 21, 15 p. (2016; Zbl 1378.68196) Full Text: DOI
Cohen-Addad, Vincent; Colin de Verdière, Éric; Klein, Philip N.; Mathieu, Claire; Meierfrankenfeld, David Approximating connectivity domination in weighted bounded-genus graphs. (English) Zbl 1376.68171 Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 584-597 (2016). MSC: 68W25 05C10 05C22 05C69 05C70 05C85 68Q25 PDF BibTeX XML Cite \textit{V. Cohen-Addad} et al., in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 584--597 (2016; Zbl 1376.68171) Full Text: DOI
Huang, Hengjie; Gong, Xiaolong; Wang, Gaocai An area coverage control algorithm based on connected dominating set for sensor networks. (Chinese. English summary) Zbl 1374.68026 J. Guangxi Norm. Univ., Nat. Sci. 34, No. 4, 19-25 (2016). MSC: 68M10 05C40 05C69 05C85 90C35 PDF BibTeX XML Cite \textit{H. Huang} et al., J. Guangxi Norm. Univ., Nat. Sci. 34, No. 4, 19--25 (2016; Zbl 1374.68026) Full Text: DOI
Fujita, Satoshi On the power of lookahead in greedy scheme for finding a minimum CDS for unit disk graphs. (English) Zbl 1404.68085 Int. J. Found. Comput. Sci. 27, No. 7, 829-843 (2016). MSC: 68R10 05C62 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{S. Fujita}, Int. J. Found. Comput. Sci. 27, No. 7, 829--843 (2016; Zbl 1404.68085) Full Text: DOI
Hussain, R. Jahir; Begam, A. Fathima Further results on connected eccentric domination number in graphs. (English) Zbl 1357.05112 Adv. Appl. Discrete Math. 17, No. 3, 243-254 (2016). MSC: 05C69 PDF BibTeX XML Cite \textit{R. J. Hussain} and \textit{A. F. Begam}, Adv. Appl. Discrete Math. 17, No. 3, 243--254 (2016; Zbl 1357.05112) Full Text: DOI Link
Dong, Jiuying; Li, Xueliang Rainbow connection number and independence number of a graph. (English) Zbl 1351.05072 Graphs Comb. 32, No. 5, 1829-1841 (2016). MSC: 05C15 05C40 05C69 05C38 PDF BibTeX XML Cite \textit{J. Dong} and \textit{X. Li}, Graphs Comb. 32, No. 5, 1829--1841 (2016; Zbl 1351.05072) Full Text: DOI arXiv
Klostermeyer, William F.; Lawrence, Mary; MacGillivray, Gary Dynamic dominating sets: the eviction model for eternal domination. (English) Zbl 1368.05112 J. Comb. Math. Comb. Comput. 97, 247-269 (2016). Reviewer: Ngoc Mai Tran (Bonn) MSC: 05C69 05C70 91A05 05C57 PDF BibTeX XML Cite \textit{W. F. Klostermeyer} et al., J. Comb. Math. Comb. Comput. 97, 247--269 (2016; Zbl 1368.05112)
Liu, Tingting; Hu, Yumei Some upper bounds for 3-rainbow index of graphs. (English) Zbl 1351.05082 J. Comb. Math. Comb. Comput. 97, 217-225 (2016). Reviewer: Hans Peter Künzi (Rondebosch) MSC: 05C15 05C40 05C69 PDF BibTeX XML Cite \textit{T. Liu} and \textit{Y. Hu}, J. Comb. Math. Comb. Comput. 97, 217--225 (2016; Zbl 1351.05082) Full Text: arXiv
Zhang, Zhao; Lee, Joong-Lyul; Wu, Weili; Du, Ding-Zhu Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs. (English) Zbl 1355.90103 Optim. Lett. 10, No. 7, 1393-1401 (2016). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{Z. Zhang} et al., Optim. Lett. 10, No. 7, 1393--1401 (2016; Zbl 1355.90103) Full Text: DOI
Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua New analysis and computational study for the planar connected dominating set problem. (English) Zbl 1354.90156 J. Comb. Optim. 32, No. 1, 198-225 (2016). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{M. Marzban} et al., J. Comb. Optim. 32, No. 1, 198--225 (2016; Zbl 1354.90156) Full Text: DOI
Finbow, Arthur S.; Hartnell, Bert L.; Nowakowski, Richard J.; Plummer, Michael D. Well-covered triangulations. IV. (English) Zbl 1346.05214 Discrete Appl. Math. 215, 71-94 (2016). MSC: 05C69 05C10 05C35 05C40 PDF BibTeX XML Cite \textit{A. S. Finbow} et al., Discrete Appl. Math. 215, 71--94 (2016; Zbl 1346.05214) Full Text: DOI
Chang, Shun-Chieh; Liu, Jia-Jie; Wang, Yue-Li The outer-connected domination number of Sierpiński-like graphs. (English) Zbl 1331.05166 Theory Comput. Syst. 58, No. 2, 345-356 (2016). MSC: 05C69 PDF BibTeX XML Cite \textit{S.-C. Chang} et al., Theory Comput. Syst. 58, No. 2, 345--356 (2016; Zbl 1331.05166) Full Text: DOI
Li, Hengzhe; Yang, Yuxing; Wu, Baoyindureng 2-edge connected dominating sets and 2-connected dominating sets of a graph. (English) Zbl 1342.90166 J. Comb. Optim. 31, No. 2, 713-724 (2016). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{H. Li} et al., J. Comb. Optim. 31, No. 2, 713--724 (2016; Zbl 1342.90166) Full Text: DOI
Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem. (English) Zbl 1341.90118 J. Comb. Optim. 31, No. 1, 136-151 (2016). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{Y. Shi} et al., J. Comb. Optim. 31, No. 1, 136--151 (2016; Zbl 1341.90118) Full Text: DOI
Pradhan, D. On the complexity of the minimum outer-connected dominating set problem in graphs. (English) Zbl 1360.90227 J. Comb. Optim. 31, No. 1, 1-12 (2016). MSC: 90C27 90C35 90C60 PDF BibTeX XML Cite \textit{D. Pradhan}, J. Comb. Optim. 31, No. 1, 1--12 (2016; Zbl 1360.90227) Full Text: DOI
Kamei, Sayaka; Izumi, Tomoko; Yamauchi, Yukiko An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs. (English) Zbl 1333.68293 Theor. Comput. Sci. 615, 102-119 (2016). MSC: 68W25 05C69 05C85 68R10 68W15 PDF BibTeX XML Cite \textit{S. Kamei} et al., Theor. Comput. Sci. 615, 102--119 (2016; Zbl 1333.68293) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter Enumerating minimal connected dominating sets in graphs of bounded chordality. (English) Zbl 1378.05199 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 307-318 (2015). MSC: 05C85 05C30 05C69 68Q25 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 307--318 (2015; Zbl 1378.05199) Full Text: DOI
Coelho, Rafael S.; Moura, Phablo F. S.; Wakabayashi, Yoshiko The \(k\)-hop connected dominating set problem: hardness and polyhedra. (English) Zbl 1347.05137 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 59-64, electronic only (2015). MSC: 05C69 05C40 52B05 68Q17 PDF BibTeX XML Cite \textit{R. S. Coelho} et al., Electron. Notes Discrete Math. 50, 59--64 (2015; Zbl 1347.05137) Full Text: DOI
Bannoura, Amir; Ortolf, Christian; Reindl, Leonhard; Schindelhauer, Christian The wake up dominating set problem. (English) Zbl 1332.68290 Theor. Comput. Sci. 608, Part 2, 120-134 (2015). MSC: 68W27 05C69 05C85 68R10 PDF BibTeX XML Cite \textit{A. Bannoura} et al., Theor. Comput. Sci. 608, Part 2, 120--134 (2015; Zbl 1332.68290) Full Text: DOI
Li, Xueliang; Wei, Meiqin; Yue, Jun Proper connection number and connected dominating sets. (English) Zbl 1333.05227 Theor. Comput. Sci. 607, Part 3, 480-487 (2015). MSC: 05C69 05C40 05C15 05C12 05C07 PDF BibTeX XML Cite \textit{X. Li} et al., Theor. Comput. Sci. 607, Part 3, 480--487 (2015; Zbl 1333.05227) Full Text: DOI arXiv
Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter On the parameterized complexity of dynamic problems. (English) Zbl 1333.68130 Theor. Comput. Sci. 607, Part 3, 426-434 (2015). MSC: 68Q25 05C69 68Q17 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Theor. Comput. Sci. 607, Part 3, 426--434 (2015; Zbl 1333.68130) Full Text: DOI
Gao, Xiaofeng; Li, Jun; Chen, Guihai A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks. (English) Zbl 1333.68210 Theor. Comput. Sci. 607, Part 3, 363-380 (2015). MSC: 68R10 05C62 05C69 68W25 PDF BibTeX XML Cite \textit{X. Gao} et al., Theor. Comput. Sci. 607, Part 3, 363--380 (2015; Zbl 1333.68210) Full Text: DOI
Torkestani, Javad Akbari Algorithms for Steiner connected dominating set problem based on learning automata theory. (English) Zbl 1346.68259 Int. J. Found. Comput. Sci. 26, No. 6, 769-801 (2015). MSC: 68W25 05C69 05C85 68Q45 68R10 PDF BibTeX XML Cite \textit{J. A. Torkestani}, Int. J. Found. Comput. Sci. 26, No. 6, 769--801 (2015; Zbl 1346.68259) Full Text: DOI
Hamid, I. Sahul; Gnanaprakasam, R.; Mary, M. Fatima Outer-connected independence in graphs. (English) Zbl 1325.05126 Discrete Math. Algorithms Appl. 7, No. 3, Article ID 1550039, 11 p. (2015). MSC: 05C69 05C40 PDF BibTeX XML Cite \textit{I. S. Hamid} et al., Discrete Math. Algorithms Appl. 7, No. 3, Article ID 1550039, 11 p. (2015; Zbl 1325.05126) Full Text: DOI
Du, Yingfan L.; Du, Hongmin W. A new bound on maximum independent set and minimum connected dominating set in unit disk graphs. (English) Zbl 1333.90140 J. Comb. Optim. 30, No. 4, 1173-1179 (2015). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{Y. L. Du} and \textit{H. W. Du}, J. Comb. Optim. 30, No. 4, 1173--1179 (2015; Zbl 1333.90140) Full Text: DOI
Zhang, Jing; Zhou, Shu-Ming; Xu, Li; Wu, Wei; Ye, Xiucai An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube. (English) Zbl 1322.94131 Int. J. Appl. Math. Comput. Sci. 25, No. 2, 295-309 (2015). MSC: 94C15 PDF BibTeX XML Cite \textit{J. Zhang} et al., Int. J. Appl. Math. Comput. Sci. 25, No. 2, 295--309 (2015; Zbl 1322.94131) Full Text: DOI
Buchanan, Austin; Sung, Je Sang; Butenko, Sergiy; Pasiliao, Eduardo L. An integer programming approach for fault-tolerant connected dominating sets. (English) Zbl 1327.90348 INFORMS J. Comput. 27, No. 1, 178-188 (2015). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{A. Buchanan} et al., INFORMS J. Comput. 27, No. 1, 178--188 (2015; Zbl 1327.90348) Full Text: DOI
Ding, Yihua; Wang, James Z.; Srimani, Pradip K. New self-stabilizing algorithms for minimal weakly connected dominating sets. (English) Zbl 1320.05089 Int. J. Found. Comput. Sci. 26, No. 2, 229-240 (2015). MSC: 05C69 05C85 PDF BibTeX XML Cite \textit{Y. Ding} et al., Int. J. Found. Comput. Sci. 26, No. 2, 229--240 (2015; Zbl 1320.05089) Full Text: DOI
Wu, Lidong; Du, Hongwei; Wu, Weili; Zhu, Yuqing; Wang, Ailan; Lee, Wonjun PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs. (English) Zbl 1325.90096 J. Comb. Optim. 30, No. 1, 18-26 (2015). MSC: 90C35 90B20 PDF BibTeX XML Cite \textit{L. Wu} et al., J. Comb. Optim. 30, No. 1, 18--26 (2015; Zbl 1325.90096) Full Text: DOI
Bendali, Fatiha; Mailfert, Jean; Memeri, Djelloul On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm. (English) Zbl 1314.05145 RAIRO, Oper. Res. 49, No. 2, 313-334 (2015). Reviewer: Sandi Klavžar (Ljubljana) MSC: 05C69 05C40 05C85 05C82 05C35 68Q25 68Q17 PDF BibTeX XML Cite \textit{F. Bendali} et al., RAIRO, Oper. Res. 49, No. 2, 313--334 (2015; Zbl 1314.05145) Full Text: DOI
Hasunuma, Toru Structural properties of subdivided-line graphs. (English) Zbl 1325.05139 J. Discrete Algorithms 31, 69-86 (2015). MSC: 05C76 05C45 05C40 05C90 05C82 PDF BibTeX XML Cite \textit{T. Hasunuma}, J. Discrete Algorithms 31, 69--86 (2015; Zbl 1325.05139) Full Text: DOI
Liu, Jia-Jie; Wang, Cindy Tzu-Hsin; Wang, Yue-Li; Yen, William Chung-Kung The hub number of co-comparability graphs. (English) Zbl 1306.05182 Theor. Comput. Sci. 570, 15-21 (2015). MSC: 05C69 PDF BibTeX XML Cite \textit{J.-J. Liu} et al., Theor. Comput. Sci. 570, 15--21 (2015; Zbl 1306.05182) Full Text: DOI
Amos, David; Caro, Yair; Davila, Randy; Pepper, Ryan Upper bounds on the \(k\)-forcing number of a graph. (English) Zbl 1304.05041 Discrete Appl. Math. 181, 1-10 (2015). MSC: 05C15 05C69 05C35 PDF BibTeX XML Cite \textit{D. Amos} et al., Discrete Appl. Math. 181, 1--10 (2015; Zbl 1304.05041) Full Text: DOI arXiv
Bannoura, Amir; Ortolf, Christian; Schindelhauer, Christian; Reindl, Leonhard The wake up dominating set problem. (English) Zbl 1397.68132 Flocchini, Paola (ed.) et al., Algorithms for sensor systems. 9th international symposium on algorithms and experiments for sensor systems, wireless networks and distributed robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-642-45345-8/pbk; 978-3-642-45346-5/ebook). Lecture Notes in Computer Science 8243, 35-50 (2014). MSC: 68R10 05C69 05C85 PDF BibTeX XML Cite \textit{A. Bannoura} et al., Lect. Notes Comput. Sci. 8243, 35--50 (2014; Zbl 1397.68132) Full Text: DOI
Chen, Weidong; Lu, Zaixin; Wu, Weili Dominating problems in swapped networks. (English) Zbl 1339.68201 Inf. Sci. 269, 286-299 (2014). MSC: 68R10 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{W. Chen} et al., Inf. Sci. 269, 286--299 (2014; Zbl 1339.68201) Full Text: DOI
Badawi, Ayman On the total graph of a ring and its related graphs: a survey. (English) Zbl 1327.13007 Fontana, Marco (ed.) et al., Commutative algebra. Recent advances in commutative rings, integer-valued polynomials, and polynomial functions. Based on mini-courses and a conference on commutative rings, integer-valued polynomials and polynomial functions, Graz, Austria, December 16–18 and December 19–22, 2012. New York, NY: Springer (ISBN 978-1-4939-0924-7/hbk; 978-1-4939-0925-4/ebook). 39-54 (2014). MSC: 13A15 13B99 05C99 PDF BibTeX XML Cite \textit{A. Badawi}, in: Commutative algebra. Recent advances in commutative rings, integer-valued polynomials, and polynomial functions. Based on mini-courses and a conference on commutative rings, integer-valued polynomials and polynomial functions, Graz, Austria, December 16--18 and December 19--22, 2012. New York, NY: Springer. 39--54 (2014; Zbl 1327.13007) Full Text: DOI
Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter On the parameterized complexity of dynamic problems with connectivity constraints. (English) Zbl 1434.68204 Zhang, Zhao (ed.) et al., Combinatorial optimization and applications. 8th international conference, COCOA 2014, Wailea, Maui, HI, USA, December 19–21, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8881, 625-636 (2014). MSC: 68Q27 05C69 68Q17 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Lect. Notes Comput. Sci. 8881, 625--636 (2014; Zbl 1434.68204) Full Text: DOI
Buchanan, Austin; Sung, Je Sang; Boginski, Vladimir; Butenko, Sergiy On connected dominating sets of restricted diameter. (English) Zbl 1317.90303 Eur. J. Oper. Res. 236, No. 2, 410-418 (2014). MSC: 90C35 90B18 05C69 PDF BibTeX XML Cite \textit{A. Buchanan} et al., Eur. J. Oper. Res. 236, No. 2, 410--418 (2014; Zbl 1317.90303) Full Text: DOI
Kanté, Mamadou Moustapha; Limouzy, Vincent; Mary, Arnaud; Nourine, Lhouari On the enumeration of minimal dominating sets and related notions. (English) Zbl 1310.05119 SIAM J. Discrete Math. 28, No. 4, 1916-1929 (2014). MSC: 05C30 05C69 05C85 05C65 PDF BibTeX XML Cite \textit{M. M. Kanté} et al., SIAM J. Discrete Math. 28, No. 4, 1916--1929 (2014; Zbl 1310.05119) Full Text: DOI arXiv
Delić, Dejan; Wang, Changping The global connected domination in graphs. (English) Zbl 1324.05139 Ars Comb. 114, 105-110 (2014). MSC: 05C69 05C85 PDF BibTeX XML Cite \textit{D. Delić} and \textit{C. Wang}, Ars Comb. 114, 105--110 (2014; Zbl 1324.05139)
Klostermeyer, William F.; MacGillivray, Gary Eternal domination in trees. (English) Zbl 1310.05161 J. Comb. Math. Comb. Comput. 91, 31-50 (2014). MSC: 05C69 05C05 PDF BibTeX XML Cite \textit{W. F. Klostermeyer} and \textit{G. MacGillivray}, J. Comb. Math. Comb. Comput. 91, 31--50 (2014; Zbl 1310.05161)
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket The kernelization complexity of connected domination in graphs with (no) small cycles. (English) Zbl 1318.68096 Algorithmica 68, No. 2, 504-530 (2014). MSC: 68Q25 05C12 05C69 PDF BibTeX XML Cite \textit{N. Misra} et al., Algorithmica 68, No. 2, 504--530 (2014; Zbl 1318.68096) Full Text: DOI
Li, Meng; Otachi, Yota; Tokuyama, Takeshi Efficient algorithms for network localization using cores of underlying graphs. (English) Zbl 1360.68649 Theor. Comput. Sci. 553, 18-26 (2014). MSC: 68R10 05C62 05C69 05C85 PDF BibTeX XML Cite \textit{M. Li} et al., Theor. Comput. Sci. 553, 18--26 (2014; Zbl 1360.68649) Full Text: DOI
Zhou, Jiao; Zhang, Zhao; Wu, Weili; Xing, Kai A greedy algorithm for the fault-tolerant connected dominating set in a general graph. (English) Zbl 1298.90122 J. Comb. Optim. 28, No. 1, 310-319 (2014). MSC: 90C35 PDF BibTeX XML Cite \textit{J. Zhou} et al., J. Comb. Optim. 28, No. 1, 310--319 (2014; Zbl 1298.90122) Full Text: DOI
Censor-Hillel, Keren; Gilbert, Seth; Kuhn, Fabian; Lynch, Nancy; Newport, Calvin Structuring unreliable radio networks. (English) Zbl 1291.68041 Distrib. Comput. 27, No. 1, 1-19 (2014). MSC: 68M14 05C69 68W15 PDF BibTeX XML Cite \textit{K. Censor-Hillel} et al., Distrib. Comput. 27, No. 1, 1--19 (2014; Zbl 1291.68041) Full Text: DOI
Favaron, O.; Karami, H.; Sheikholeslami, S. M. On the total outer-connected domination in graphs. (English) Zbl 1291.90284 J. Comb. Optim. 27, No. 3, 451-461 (2014). MSC: 90C39 PDF BibTeX XML Cite \textit{O. Favaron} et al., J. Comb. Optim. 27, No. 3, 451--461 (2014; Zbl 1291.90284) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. (English) Zbl 1354.68120 Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 92-103 (2013). MSC: 68Q25 05C69 05C83 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 20, 92--103 (2013; Zbl 1354.68120) Full Text: DOI
Liu, Qinghai; Zhang, Zhao; Hong, Yanmei; Wu, Weili; Du, Ding-Zhu A PTAS for weak minimum routing cost connected dominating set of unit disk graph. (English) Zbl 1308.90188 Chinchuluun, Altannar (ed.) et al., Optimization, simulation, and control. New York, NY: Springer (ISBN 978-1-4614-5130-3/hbk; 978-1-4614-5131-0/ebook). Springer Optimization and Its Applications 76, 131-142 (2013). MSC: 90C35 PDF BibTeX XML Cite \textit{Q. Liu} et al., Springer Optim. Appl. 76, 131--142 (2013; Zbl 1308.90188) Full Text: DOI
Daum, Sebastian; Ghaffari, Mohsen; Gilbert, Seth; Kuhn, Fabian; Newport, Calvin Maximal independent sets in multichannel radio networks. (English) Zbl 1323.68418 Proceedings of the 2013 ACM symposium on principles of distributed computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2065-8). 335-344 (2013). MSC: 68R10 05C69 05C85 68M10 68M14 68Q17 68Q25 68W15 PDF BibTeX XML Cite \textit{S. Daum} et al., in: Proceedings of the 32nd ACM symposium on principles of distributed computing, PODC '13, Montreal, QC, Canada, July 22--24, 2013. New York, NY: Association for Computing Machinery (ACM). 335--344 (2013; Zbl 1323.68418) Full Text: DOI
Dong, Jiu-Ying; Li, Xue-Liang Upper bound involving parameter \(\sigma_2\) for the rainbow connection number. (English) Zbl 1283.05091 Acta Math. Appl. Sin., Engl. Ser. 29, No. 4, 685-688 (2013). MSC: 05C15 05C40 05C69 PDF BibTeX XML Cite \textit{J.-Y. Dong} and \textit{X.-L. Li}, Acta Math. Appl. Sin., Engl. Ser. 29, No. 4, 685--688 (2013; Zbl 1283.05091) Full Text: DOI
Jou, Min-Jen Connected graphs with a large number of independent sets. (English) Zbl 1280.05102 Taiwanese J. Math. 17, No. 6, 2011-2017 (2013). MSC: 05C69 05C40 05C30 68R10 PDF BibTeX XML Cite \textit{M.-J. Jou}, Taiwanese J. Math. 17, No. 6, 2011--2017 (2013; Zbl 1280.05102) Full Text: DOI Link
He, Jing (Selena); Ji, Shouling; Pan, Yi; Cai, Zhipeng Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks. (English) Zbl 1301.68035 Theor. Comput. Sci. 507, 2-16 (2013). MSC: 68M10 68W25 05C69 PDF BibTeX XML Cite \textit{J. He} et al., Theor. Comput. Sci. 507, 2--16 (2013; Zbl 1301.68035) Full Text: DOI
Luo, Weizhong; Wang, Jianxin; Feng, Qilong; Guo, Jiong; Chen, Jianer Improved linear problem kernel for planar connected dominating set. (English) Zbl 1358.05285 Theor. Comput. Sci. 511, 2-12 (2013). MSC: 05C85 05C69 PDF BibTeX XML Cite \textit{W. Luo} et al., Theor. Comput. Sci. 511, 2--12 (2013; Zbl 1358.05285) Full Text: DOI
Akhbari, M. H.; Hasni, R.; Favaron, O.; Karami, H.; Sheikholeslami, S. M. On the outer-connected domination in graphs. (English) Zbl 1275.90111 J. Comb. Optim. 26, No. 1, 10-18 (2013). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{M. H. Akhbari} et al., J. Comb. Optim. 26, No. 1, 10--18 (2013; Zbl 1275.90111) Full Text: DOI
Wang, Jianxin; Yang, Yongjie; Guo, Jiong; Chen, Jianer Planar graph vertex partition for linear problem kernels. (English) Zbl 1268.68136 J. Comput. Syst. Sci. 79, No. 5, 609-621 (2013). MSC: 68R10 68Q25 05C85 05C10 05C69 05C70 PDF BibTeX XML Cite \textit{J. Wang} et al., J. Comput. Syst. Sci. 79, No. 5, 609--621 (2013; Zbl 1268.68136) Full Text: DOI
Guibas, Leonidas; Milosavljević, Nikola; Motskin, Arik Connected dominating sets on dynamic geometric graphs. (English) Zbl 1254.05139 Comput. Geom. 46, No. 2, 160-172 (2013). MSC: 05C69 05C85 68M10 68R10 PDF BibTeX XML Cite \textit{L. Guibas} et al., Comput. Geom. 46, No. 2, 160--172 (2013; Zbl 1254.05139) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Linear kernels for (connected) dominating set on \(H\)-minor-free graphs. (English) Zbl 1421.68078 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 82-93 (2012). MSC: 68Q25 05C69 05C83 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 82--93 (2012; Zbl 1421.68078) Full Text: Link
Muddebihal, M. H.; Swati, Kalshetti Connected lict domination in graphs. (English) Zbl 1339.05293 Ultra Sci. Phys. Sci., Sect. A 24, No. 3, 459-468 (2012). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{M. H. Muddebihal} and \textit{K. Swati}, Ultra Sci. Phys. Sci., Sect. A 24, No. 3, 459--468 (2012; Zbl 1339.05293)
Kumar, K. Reji; Satheesh, E. N. Connected eternal domination in graphs. (English) Zbl 1286.05124 Adv. Appl. Discrete Math. 10, No. 2, 135-147 (2012). MSC: 05C69 05C35 PDF BibTeX XML Cite \textit{K. R. Kumar} and \textit{E. N. Satheesh}, Adv. Appl. Discrete Math. 10, No. 2, 135--147 (2012; Zbl 1286.05124) Full Text: Link
Dutton, Ronald Total vertex covers. (English) Zbl 1270.05080 Bull. Inst. Comb. Appl. 66, 33-41 (2012). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C70 05C69 PDF BibTeX XML Cite \textit{R. Dutton}, Bull. Inst. Comb. Appl. 66, 33--41 (2012; Zbl 1270.05080)
Tian, Ye Outer-connected domination upon edge removal in graphs. (Chinese. English summary) Zbl 1274.05272 J. Hebei Norm. Univ., Nat. Sci. Ed. 36, No. 4, 332-335, 354 (2012). MSC: 05C40 05C69 PDF BibTeX XML Cite \textit{Y. Tian}, J. Hebei Norm. Univ., Nat. Sci. Ed. 36, No. 4, 332--335, 354 (2012; Zbl 1274.05272)