EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The Hop Domination Number of Comb Product Graphs

D. Anusha, S. Joseph Robin

LIPS NEXORA: Journal of Interdisciplinary Discovery · 03.06.2026 · 1 (2) · 39-42

DOI: 10.68875/lnx.1.2.010 ↗

Kurz gefasst

Fachartikel in der Zeitschrift LIPS NEXORA: Journal of Interdisciplinary Discovery, online erschienen am 03.06.2026. Verfasst von D. Anusha und 1 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A set S ⊆ V of a graph G is a hop dominating set of G if for every v ∈ V − S, there exists u ∈ S such that d(u, v) = 2. The minimum cardinality of a hop dominating set of G is called the hop domination number and is denoted by γₕ(G). Any hop dominating set of order γₕ(G) is called a γₕ-set of G. In this paper, we study the concept of the hop domination number of the comb product of some standard graphs.

Zitieren

APA

Anusha, D., & Robin, S. J. (2026). The Hop Domination Number of Comb Product Graphs. LIPS NEXORA: Journal of Interdisciplinary Discovery, 1(2), 39-42. https://doi.org/10.68875/lnx.1.2.010

Vancouver

Anusha D, Robin SJ. The Hop Domination Number of Comb Product Graphs. LIPS NEXORA: Journal of Interdisciplinary Discovery. 2026;1(2):39-42. doi:10.68875/lnx.1.2.010

BibTeX
@article{Anusha2026,
  author = {Anusha, D. and Robin, S. Joseph},
  title = {The Hop Domination Number of Comb Product Graphs},
  journal = {LIPS NEXORA: Journal of Interdisciplinary Discovery},
  year = {2026},
  volume = {1},
  number = {2},
  pages = {39--42},
  doi = {10.68875/lnx.1.2.010}
}
Kostenlos starten →