Author:
Banerjee Sandip,Bhore Sujoy
Publisher
Springer International Publishing
Reference17 articles.
1. Banerjee, S., Bhore, S.: Algorithm and hardness results on liar’s dominating set and $$k$$ -tuple dominating set. CoRR, abs/1902.11149 (2019)
2. Bishnu, A., Ghosh, A., Paul, S.: Linear kernels for k-tuple and liar’s domination in bounded genus graphs. Discrete Appl. Math. 231, 67–77 (2017)
3. Chang, G.J.: Algorithmic aspects of domination in graphs. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1811–1877. Springer, Boston (1998). https://doi.org/10.1007/978-1-4613-0303-9_28
4. Chellali, M., Favaron, O., Hansberg, A., Volkmann, L.: k-domination and k-independence in graphs: a survey. Graphs Comb. 28(1), 1–55 (2012)
5. Fink, J.F., Jacobson, M.S.: n-domination in graphs. In: Graph theory with Applications to Algorithms and Computer Science, pp. 283–300. Wiley, Hoboken (1985)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献