Abstract
Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems, computer and social networks, monitoring communication, coding theory, and algorithm design, among others. In the last two decades, the functions defined on graphs have attracted the attention of several researchers. The Roman-dominating functions and their variants are one of the main attractions. This paper is a contribution to the Roman domination theory in graphs. In particular, we provide some interesting properties and relationships between one of its variants: the quasi-total Roman domination in graphs.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference22 articles.
1. Fundamentals of Domination in Graphs;Haynes,1998
2. Fundamentals of Domination in Graphs: Advanced Topics;Haynes,1998
3. Roman domination in graphs
4. Defendens Imperium Romanum: A Classical Problem in Military Strategy
5. Defend the Roman Empire!
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Quasi total double Roman domination in graphs;AKCE International Journal of Graphs and Combinatorics;2024-02-26
2. Quasi-total Roman reinforcement in graphs;AKCE International Journal of Graphs and Combinatorics;2022-12-19
3. Quasi-total Roman bondage number in graphs;AKCE International Journal of Graphs and Combinatorics;2022-09-02