Author:
Chaudhary Juhi,Pradhan Dinabandhu
Funder
Science and Engineering Research Board
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference36 articles.
1. On the double Roman domination in graphs;Ahangar;Discrete Appl. Math.,2017
2. Some APX-completeness results for cubic graphs;Alimonti;Theoret. Comput. Sci.,2007
3. An upper bound on the double Roman domination number;Amjadi;J. Comb. Optim.,2018
4. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties;Ausiello,2012
5. Algorithmic results on double Roman domination in graphs;Banerjee;J. Comb. Optim.,2020
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unique Response Roman Domination: Complexity and Algorithms;Algorithmica;2023-09-04
2. Genetic algorithm based approach for solving Roman {3}-domination problem;2023 International Conference on Computer, Electronics & Electrical Engineering & their Applications (IC2E3);2023-06-08