On the complexity of some hop domination parameters

DOI10.5614/EJGTA.2019.7.1.6zbMATH Open1467.05191OpenAlexW2936362229MaRDI QIDQ5009934FDOQ5009934

Authors: Nader Jafari Rad, E. Shabani 

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2019.7.1.6

Recommendations

• Hop total Roman domination in graphs
• On hop Roman domination in trees
• Graphs with large hop Roman domination number
• Complexity aspects of variants of independent Roman domination in graphs
• On algorithmic complexity of double Roman domination

zbMATH Keywords

complexitydominating sethop dominating sethop independent sethop Roman dominating functionhop Roman independent dominating function

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?)
• Roman domination in graphs.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Hop domination in graphs. II
• Bounds on the hop domination number of a tree
• On 2-step and hop dominating sets in graphs
• On the complexity of \(k\)-step and \(k\)-hop dominating sets in graphs

Cited In (8)

• Graphs with large hop Roman domination number
• Algorithm and hardness results on hop domination in graphs
• Hop total Roman domination in graphs
• Further results on the hop domination number of a graph
• On hop Roman domination in trees
• On the \(k\)-rainbow domination in graphs with bounded tree-width
• On the complexity of \(k\)-step and \(k\)-hop dominating sets in graphs
• A new look at the concept of domination in hypergraphs

This page was built for publication: On the complexity of some hop domination parameters

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