| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651166 | Discrete Mathematics | 2007 | 5 Pages |
Abstract
In this paper we discuss the total domination number with respect to the conjunction of two graphs. We estimate the total domination number of the conjunction G∧HG∧H, showing that γt(G∧H)⩽γt(G)γt(H)γt(G∧H)⩽γt(G)γt(H), for graphs having no isolated vertices. Additionally, we show that for G≅PnG≅Pn or for G and H having the domination number equal to half their orders, the equality is attained.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maciej Zwierzchowski,