On a Vizing-like conjecture for direct product graphs

被引:15
|
作者
Klavzar, S [1 ]
Zmazek, B [1 ]
机构
[1] UNIV MARIBOR,PEF,DEPT MATH,MARIBOR 2000,SLOVENIA
关键词
D O I
10.1016/0012-365X(96)00032-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let gamma(G) be the domination number of a graph G, and let G x H be the direct product of graphs G and H. It is shown that for any k greater than or equal to 0 there exists a graph G such that gamma(G x C) less than or equal to gamma(G)(2) - k. This in particular disproves a conjecture from [5].
引用
收藏
页码:243 / 246
页数:4
相关论文
共 50 条