Abstract
Let G be a graph without isolated vertices. A function f : V ( G ) → { 0 , 1 , 2 } is a total Roman dominating function on G if every vertex v ∈ V ( G ) for which f ( v ) = 0 is adjacent to at least one vertex u ∈ V ( G ) such that f ( u ) = 2 , and if the subgraph induced by the set { v ∈ V ( G ) : f ( v ) ≥ 1 } has no isolated vertices. The total Roman domination number of G, denoted γ t R ( G ) , is the minimum weight ω ( f ) = ∑ v ∈ V ( G ) f ( v ) among all total Roman dominating functions f on G. In this article we obtain new tight lower and upper bounds for γ t R ( G ) which improve the well-known bounds 2 γ ( G ) ≤ γ t R ( G ) ≤ 3 γ ( G ) , where γ ( G ) represents the classical domination number. In addition, we characterize the graphs that achieve equality in the previous lower bound and we give necessary conditions for the graphs which satisfy the equality in the upper bound above.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference18 articles.
1. Fundamentals of Domination in Graphs;Haynes,1998
2. Domination in Graphs: Advanced Topics;Haynes,1998
3. A survey of selected recent results on total domination in graphs
4. Total Domination in Graphs. Springer Monographs in Mathematics;Henning,2013
5. Semitotal domination in graphs;Goddard;Util. Math.,2014
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献