Hop total Roman domination in graphs

DOI10.1080/09728600.2023.2184288MaRDI QIDQ6166240zbMATH OpenFDO

Authors H. Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmood Sheikholeslami, Marzieh Soroudi

Publication date 2 August 2023

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

hop Roman domination numberhop total domination numberhop total Roman domination

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of some hop domination parameters
• On hop Roman domination in trees
• Graphs with large hop Roman domination number
• Total Roman \(\{2\}\)-domination in graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs

Cites work

• Bounds on the hop domination number of a tree
• Graphs with large hop Roman domination number
• Hop domination in graphs. II
• On 2-step and hop dominating sets in graphs
• On hop Roman domination in trees
• Roman domination in graphs.

Cited in

(3)

• On the complexity of some hop domination parameters
• Graphs with large hop Roman domination number
• On hop Roman domination in trees

This page was built for publication: Hop total Roman domination in graphs

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