Department of Pure and Applied Mathematics, University of Johannesburg, South Africa \newline Research fellow of the Claude Leon Foundation. Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Poland.
Abstract
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $\gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 69--75] established the following upper bound on the total domination number of a tree in terms of the order and the number of support vertices, $\gamma_t(T) \le (n+s)/2$. We characterize all trees attaining this upper bound.
Krzywkowski, M. (2015). On trees attaining an upper bound on the total domination number. Bulletin of the Iranian Mathematical Society, 41(6), 1339-1344.
MLA
Krzywkowski, M. "On trees attaining an upper bound on the total domination number", Bulletin of the Iranian Mathematical Society, 41, 6, 2015, 1339-1344.
HARVARD
Krzywkowski M. (2015). 'On trees attaining an upper bound on the total domination number', Bulletin of the Iranian Mathematical Society, 41(6), pp. 1339-1344.
CHICAGO
M. Krzywkowski, "On trees attaining an upper bound on the total domination number," Bulletin of the Iranian Mathematical Society, 41 6 (2015): 1339-1344,
VANCOUVER
Krzywkowski M. On trees attaining an upper bound on the total domination number. BIMS. 2015;41(6):1339-1344.
