On the complexity of some hop domination parameters

DOI10.5614/ejgta.2019.7.1.6zbMath1467.05191OpenAlexW2936362229MaRDI QIDQ5009934

E. Shabani, Nader Jafari Rad

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

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)

Related Items (1)

On the k-rainbow domination in graphs with bounded tree-width

Cites Work

• Bounds on the hop domination number of a tree
• Roman domination in graphs.
• On 2-step and hop dominating sets in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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