Connected Roman Hop Dominating Functions in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i1.5648Keywords:
Connected Hop Domination, Roman DominationAbstract
Let $G$ be a connected graph. A hop Roman dominating function $f:V(G)\to \{0,1,2\}$ is a connected hop Roman dominating function (CHRDF) on $G$ if the set $\{u\in V(G): f(u)\neq 0\}$ induces a connected subgraph of $G$. The of weight of a CHRDF f is given by $\omega_G^{cRh}(f)=\sum_{v\in V(G)}f(v)$ and the minimum weight among all connected hop Roman dominating functions on $G$, denoted $\gamma_{cRh}(G)$, is the connected hop Roman domination number of $G$. In this paper, we show that the parameter lies between the connected hop domination number of $G$ and twice this number. We characterize the graphs that attain small values of the parameter and determine the connected hop Roman domination
number of some graphs.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Alkajim Aradais, Jerry Boy Cariaga, Sergio Canoy, Jr.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.