Total Roman \2\-domination in graphs

DOI10.2989/16073606.2019.1695230MaRDI QIDQ4986532zbMATH OpenOpenAlexFDO

Authors Suitberto Cabrera García, Abel Cabrera Martínez, F. A. Hernández-Mira, Ismael G. Yero

Publication date 27 April 2021

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.02537

zbMATH Keywords

total dominationRoman \(\{2\}\)-dominationtotal Roman \(\{2\}\)-dominationtotal Roman domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Abstract: Given a graph $G=(V,E)$, a function $f:Vightarrow0,1,2$ is a total Roman $2$-dominating function if: (1) every vertex $vinV$ for which $f(v)=0$ satisfies that $su{m}_{uinN(v)}f(u)geq2$, where $N(v)$ represents the open neighborhood of $v$, and (2) every vertex $xinV$ for which $f(x)geq1$ is adjacent to at least one vertex $yinV$ such that $f(y)geq1$. The weight of the function $f$ is defined as $omega(f)=su{m}_{vinV}f(v)$. The total Roman $2$-domination number, denoted by $gamm{a}_{tR2}(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 $gamm{a}_{tR2}(G)$ is NP-hard, even when restricted to bipartite or chordal graphs.

Recommendations

• Total Roman \(\{2\}\)-dominating functions in graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• Roman \(\{2 \}\)-domination
• Total roman domination in graphs
• On the total Roman domination stability in graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1792607 (Why is no real title available?)
• scientific article; zbMATH DE number 2188616 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• Construction of trees and graphs with equal domination parameters
• Dominating Sets in Chordal Graphs
• Independent and double domination in trees
• Italian domination in trees
• On Double Domination in Graphs
• On the total Roman domination in trees
• Roman \(\{2 \}\)-domination
• Roman domination on strongly chordal graphs
• Some remarks on domination
• Total Roman domination in the lexicographic product of graphs
• Total domination in graphs
• Total roman domination in graphs

Cited in

(24)

• Hop total Roman domination in graphs
• Note on 2-rainbow domination and Roman domination in graphs
• On 2-rainbow domination and roman domination in graphs
• Difference between 2-rainbow domination and roman domination in graphs
• From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
• Independent Roman \(\{2 \}\)-domination in graphs
• Total Roman \(\{2\}\)-reinforcement of graphs
• Further progress on the total Roman \(\{2\}\)-domination number of graphs
• Total Roman \(\{2\}\)-dominating functions in graphs
• Algorithmic aspects of total Roman ${2}$-domination in graphs
• Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
• An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two
• Quasi-total Roman domination in graphs
• On the total Roman domination stability in graphs
• Relating the total \(\{2\}\)-domination number with the total domination number of graphs
• Domination parameters with number 2: interrelations and algorithmic consequences
• Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• Total Roman domination for proper interval graphs
• Total Roman reinforcement in graphs
• scientific article; zbMATH DE number 7693187 (Why is no real title available?)
• From \(w\)-domination in graphs to domination parameters in lexicographic product graphs
• Starred Italian domination in graphs
• Total Roman domination in the lexicographic product of graphs

This page was built for publication: Total Roman \(\{2\}\)-domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986532)