Abstract
Given a graph G = (V, E), a function f: V → {0, 1, 2} is a total Roman {2}-dominating function if every vertex ʋ ∈ V for which f (ʋ) = 0 satisfies that ∑ u ∈N (ʋ) f (ʋ) ≥ 2, where N (ʋ) represents the open neighborhood of ʋ, and every vertex x ∈ V for which f (x) ≥ 1 is adjacent to at least one vertex y ∈ V such that f (y) ≥ 1. The weight of the function f is defined as ω(f ) = ∑ ʋ ∈V f (ʋ). The total Roman {2}-domination number, denoted by γt {R2}(G), is the minimum weight among all total Roman {2}-dominating functions on G. In this article we introduce the concepts above and begin the study of its combinatorial and computational properties. For instance, we give several closed relationships between this parameter and other domination related parameters in graphs. In addition, we prove that the complexity of computing the value γt {R2}(G) is NP-hard, even when restricted to bipartite or chordal graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
