@article {
author = {Eakawinrujee, Pannawat and Trakultraipruk, Nantapath},
title = {γ-Total Dominating Graphs of Lollipop, Umbrella, and Coconut Graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {},
number = {},
pages = {-},
year = {2024},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2024.27940.1401},
abstract = {A total dominating set of a graph $G$ is a set $D\subseteq V(G)$ such that every vertex of $G$ is adjacent to some vertex in $D$. The total domination number $\gamma_{t}(G)$ of $G$ is the minimum cardinality of a total dominating set. The $\gamma$-total dominating graph $TD_{\gamma}(G)$ of $G$ is the graph whose vertices are minimum total dominating sets, and two minimum total dominating sets of $TD_{\gamma}(G)$ are adjacent if they differ by only one vertex. In this paper, we determine the total domination numbers of lollipop graphs, umbrella graphs, and coconut graphs, and especially their $\gamma$-total dominating graphs.},
keywords = {total domination number,total dominating graph,gamma graph},
url = {https://comb-opt.azaruniv.ac.ir/article_14753.html},
eprint = {https://comb-opt.azaruniv.ac.ir/article_14753_71cea3971482682c6566a15610b10a6a.pdf}
}