共 50 条
Total domination number of the conjunction of graphs
被引:5
|作者:
Zwierzchowski, Maciej
[1
]
机构:
[1] Tech Univ Szczecin, Inst Math, PL-70310 Szczecin, Poland
关键词:
total domination number;
conjunction of graphs;
D O I:
10.1016/j.disc.2005.11.047
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
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 boolean AND H, showing that gamma(t) (G boolean AND H) <= gamma t (G)gamma t (H), for graphs having no isolated vertices. Additionally, we show that for G congruent to Pu or for G and H having the domination number equal to half their orders, the equality is attained. (c) 2006 Published by Elsevier B.V.
引用
收藏
页码:1016 / 1020
页数:5
相关论文