Paired Domination of Cartesian Products of Graphs

被引:0
作者
Xin Min HOU
机构
基金
中国国家自然科学基金;
关键词
domination; paired domination; Cartesian product;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
Let γpr(G) denote the paired domination number and G H denote the Cartesian product of graphs G and H. In this paper we show that for all graphs G and H without isolated vertex, γpr(G)γpr(H) ≤ 7γpr(G H).
引用
收藏
页码:181 / 185
页数:5
相关论文
共 1 条
  • [1] On the total domination number of Cartesian products of graphs
    Henning, MA
    Rall, DF
    [J]. GRAPHS AND COMBINATORICS, 2005, 21 (01) : 63 - 69