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

DOI10.61091/JCMCC119-25zbMATH Open1544.05077MaRDI QIDQ6580152

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

Publication date: 29 July 2024

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Roman \(\{2 \}\)-domination
• Signed double Roman domination in graphs
• Total Roman \(\{2\}\)-reinforcement of graphs
• Total Roman \(\{2\}\)-dominating functions in graphs
• Further progress on the total Roman \(\{2\}\)-domination number of graphs
• Total Roman reinforcement in graphs
• Triple Roman domination in graphs
• Signed double roman domination of graphs
• On maximal 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)