On the complexity of some hop domination parameters

On the complexity of some hop domination parameters

<p>A hop Roman dominating function (HRDF) on a graph <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> is a function <span class="math"><em>f</em> : <em>V</em> → {0, 1, 2}</span&g...

Full description

Bibliographic Details
Main Authors: Nader Jafari Rad, Elahe Shabani
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
dominating set, hop dominating set, hop independent set, hop roman dominating function, hop roman independent dominating function, complexity
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/569

Internet

https://www.ejgta.org/index.php/ejgta/article/view/569

Similar Items