Double total domination of graphs Original Research Article

We are interested in a notion of domination related to both vertices and edges of graphs. We present results about α2(G), the total domination number of a graph G and study αd(G), which is the minimum value of α2(S) where S is any total dominating set of G. In particular, we prove relations between these two parameters and give lower and upper bounds for αd(G).