Abstract
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.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.