Disproofs of three conjectures on the power domination of graphs. (English) Zbl 1479.05288
Summary: In this note, we disprove three conjectures on power domination of regular graphs, one of which is posed by P. Dorbec et al. [SIAM J. Discrete Math. 27, No. 3, 1559–1574 (2013; Zbl 1290.05117)], two of which are posed by C. Lu et al. [Discrete Appl. Math. 284, 401–415 (2020; Zbl 1443.05150)], respectively.
MSC:
| 05C69 | Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) |
References:
| [1] | Aazami, A., Domination in graphs with bounded propagation: Algorithms, formulations and hardness results, J. Comb. Optim., 19, 429-456 (2010) · Zbl 1192.90215 |
| [2] | Aazami, A.; Stilp, M. D., Approximation algorithms and hardness for domination with propagation, SIAM J. Discrete Math., 23, 1382-1399 (2009) · Zbl 1209.68628 |
| [3] | Barioli, F.; Barrett, W.; Butler, S.; Cioabǎ, S. M.; Cvetković, D.; Fallat, S. M.; Godsil, C.; Haemers, W.; Hogben, L.; Mikkelson, R.; Narayan, S.; Pryporova, O.; Sciriha, I.; So, W.; Stevanović, D.; van der Holst, H.; Vander Meulen, K.; Wangsness, A., (AIM minimum rank special GraphsWork group), forcing sets and the minimum rank of graphs, Linear Algebra Appl., 428, 1628-1648 (2008) · Zbl 1135.05035 |
| [4] | Bondy, J. A.; Murty, U. S.R., Graph Theory, Graduate Texts in Mathematics (2008), Springer: Springer Heidelberg · Zbl 1134.05001 |
| [5] | Chang, G. J.; Dorbec, P.; Montassier, M.; Raspaud, A., Generalized power domination of graphs, Discrete Appl. Math., 160, 1691-1698 (2012) · Zbl 1244.05165 |
| [6] | H. Chen. C. Lu, Q. Ye, Generalized power domination in claw-free regular graphs, https://arxiv.org/abs/1905.11655. |
| [7] | Dorbec, P.; Henning, M. A.; Löwenstein, C.; Montassier, M.; Raspaud, A., Generalized power domination in regular graphs, SIAM J. Discrete Math., 27, 3, 1559-1574 (2013) · Zbl 1290.05117 |
| [8] | Dorbec, P.; Mollard, M.; Klavžar, S.; Špacapan, S., Power domination in product graphs, SIAM J. Discrete Math., 22, 554-567 (2008) · Zbl 1171.05037 |
| [9] | Dorfling, M.; Henning, M. A., A note on power domination in grid graphs, Discrete Appl. Math., 154, 1023-1027 (2006) · Zbl 1090.05054 |
| [10] | Ferrero, D.; Hogben, L.; Kenter, F.; Young, M., The relationship between \(k\)-forcing and \(k\)-power domination, Discrete Math., 341, 1789-1797 (2018) · Zbl 1384.05122 |
| [11] | Guo, J.; Niedermeier, R.; Raible, D., Improved algorithms and complexity results for power domination in graphs, Lecture Notes in Comput. Sci., 3623, 172-184 (2005) · Zbl 1122.68481 |
| [12] | Guo, J.; Niedermeier, R.; Raible, D., Improved algorithms and complexity results for power domination in graphs, Algorithmica, 52, 177-202 (2008) · Zbl 1170.68031 |
| [13] | Haynes, T. W.; Hedetniemi, S. M.; Hedetniemi, S. T.; Henning, M. A., Domination in graphs applied to electric power networks, SIAM J. Discrete Math., 15, 519-529 (2002) · Zbl 1006.05043 |
| [14] | Liao, C. S.; Lee, D. T., Power domination problem in graphs, Lecture Notes in Comput. Sci., 3595, 818-828 (2005) · Zbl 1128.90577 |
| [15] | Lu, C.; Mao, R.; Wang, B., Power domination in regular claw-free graphs, Discrete Appl. Math., 284, 401-415 (2020) · Zbl 1443.05150 |
| [16] | Wang, C.; Chen, L.; Lu, C., Power domination in block graphs, J. Comb. Optim., 31, 865-873 (2016) · Zbl 1331.05174 |
| [17] | Xu, G.; Kang, L.; Shan, E.; Zhao, M., Power domination in block graphs, Theoret. Comput. Sci., 359, 299-305 (2006) · Zbl 1098.05064 |
| [18] | Zhao, M.; Kang, L.; Chang, G. J., Power domination in graphs, Discrete Math., 306, 1812-1816 (2006) · Zbl 1099.05065 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
