Elsevier

Discrete Mathematics

Volumes 165–166, 15 March 1997, Pages 343-351
Discrete Mathematics

Contribution
Double total domination of graphs

https://doi.org/10.1016/S0012-365X(96)00181-1Get rights and content
Under an Elsevier user license
open archive

Abstract

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).

Cited by (0)