EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

TOTAL RESOLVING HOP DOMINATION IN GRAPHS

Jerson S. Mohamad

Advances and Applications in Discrete Mathematics · 20.07.2026 · 43 (6) · 845-859

DOI: 10.17654/0974165826052 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, online erschienen am 20.07.2026. Verfasst von Jerson S. Mohamad. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A set $S \subseteq V(G)$ is called a total resolving hop dominating set if it is both a resolving set and a hop dominating set, and every vertex of $S$ has a hop neighbor in $S$. The minimum cardinality of such a set is called the total resolving hop domination number, denoted by $\gamma_{t r h}(G)$. In this paper, we introduce this new graph parameter, establish its existence criteria and fundamental bounds, characterize total resolving hop dominating sets in graphs with universal vertices, and determine exact values of $\gamma_{\text {trh }}\left(P_n\right)$ and $\gamma_{\text {trh }}\left(C_n\right)$ for paths and cycles.

Zitieren

APA

Mohamad, J. S. (2026). TOTAL RESOLVING HOP DOMINATION IN GRAPHS. Advances and Applications in Discrete Mathematics, 43(6), 845-859. https://doi.org/10.17654/0974165826052

Vancouver

Mohamad JS. TOTAL RESOLVING HOP DOMINATION IN GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(6):845-859. doi:10.17654/0974165826052

BibTeX
@article{Mohamad2026,
  author = {Mohamad, Jerson S.},
  title = {TOTAL RESOLVING HOP DOMINATION IN GRAPHS},
  journal = {Advances and Applications in Discrete Mathematics},
  year = {2026},
  volume = {43},
  number = {6},
  pages = {845--859},
  doi = {10.17654/0974165826052}
}
Kostenlos starten →