On the total domination number of cross products of graphs

被引：19

作者：

Ei-Zahar, Mohamed ^{[1
]}

Gravier, Sylvain ^{[2
]}

Klobucar, Antoaneta ^{[3
]}

机构：

[1] Ain Shams Univ, Fac Sci, Dept Math, Cairo, Egypt

[2] Inst Fourier, ERTe Matha Modeler, CNRS, GeoD Res Grp, F-38402 St Martin Dheres, France

[3] Ekonomski Fac, Osijek, Croatia

来源：

DISCRETE MATHEMATICS | 2008年 / 308卷 / 10期

关键词：

total domination number;

D O I：

10.1016/j.disc.2007.04.034

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give lower and upper bounds on the total domination number of the cross product of two graphs, gamma(t) (G x H). These bounds are in terms of the total domination number and the maximum degree of the factors and are best possible. We further investigate cross products involving paths and cycles. We determine the exact values of gamma(t) (G x Pn) and gamma(t) (C-n x C-m) where P-n and C-n denote. respectively, a path and a cycle of length n. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：2025 / 2029

页数：5