%0 Journal Article
%T On the total domatic number of regular graphs
%A H. Aram
%A S.M. Sheikholeslami
%A L. Volkmann
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%X A set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domatic number of a graph G is the maximum number of total dominating sets into which the vertex set of G can be partitioned. We show that the total domatic number of a random r-regular graph is almost surely at most r
%K total dominating set
%K total domination number
%K total domatic number
%K Regular graph
%U http://www.combinatorics.ir/?_action=showPDF&article=760&_ob=362cc9c41ad1def424bd149103450c49&fileName=full_text.pdf