On resolving total dominating set of sunlet graphs
| Autor: | R S R Ervani, Dafik, I. M. Tirta, Robiatul Adawiyah, Ridho Alfarisi |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Journal of Physics: Conference Series. 1832:012020 |
| ISSN: | 1742-6596 1742-6588 |
| DOI: | 10.1088/1742-6596/1832/1/012020 |
| Popis: | The set D ⊆ V(G) is called dominating set on graph G so that every vertex not in D is adjacent to at least one vertex in D. The set Dt ⊆ V(G) is called total dominating set on graph G so that the vertex in Dt are neighboring at least one dot in Dt . The smallest cardinality of the total dominating set is referred to as total domination number. The total domination number in G is shown by γt (G). The set of vertex Dt ⊆ V(G) is resolving total dominating set from G if the vertex representation u,υ ∈ V(G) with respect to x ∈ Dt is r(υ|Dt ) so that r(υ|Dt ) ≠ r(u|Dt ). The smallest cardinality of Resolving total dominating set in G is shown by γrt (G). In this article, we provide the results of the study for the differentiating number of total dominance from sunlet graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|