An upper bound on the total Roman \2\-domination number of graphs with minimum degree two

DOI10.61091/JCMCC119-25MaRDI QIDQ6580152zbMATH OpenFDO

Authors M. Kheibari, H. Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmood Sheikholeslami

Publication date 29 July 2024

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Total Roman \(\{2\}\)-domination in graphs
• On the total Roman domination number of graphs.
• Total Roman \(\{2\}\)-dominating functions in graphs
• Total roman domination in graphs
• Roman and total domination

Cites work

• scientific article; zbMATH DE number 6769213 (Why is no real title available?)
• Bounds on the outer-independent double Italian domination number
• Further progress on the total Roman \(\{2\}\)-domination number of graphs
• On maximal Roman domination in graphs
• Roman \(\{2 \}\)-domination
• Roman, Italian, and 2-domination
• Signed double Roman domination in graphs
• Signed double roman domination of graphs
• The Italian domatic number of a digraph
• Total Roman \(\{2\}\)-dominating functions in graphs
• Total Roman \(\{2\}\)-reinforcement of graphs
• Total Roman reinforcement in graphs
• Triple Roman domination in graphs

This page was built for publication: An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two

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