๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the upper total domination number of Cartesian products of graphs

โœ Scribed by Paul Dorbec; Michael A. Henning; Douglas F. Rall

Publisher
Springer US
Year
2007
Tongue
English
Weight
310 KB
Volume
16
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the domination number of cross produc
On the domination number of cross products of graphs
โœ Sylvain Gravier; Abdelkader Khelladi ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB

In this communication the domination number of the cross product of an elementary path with the complement of another path is exactly determined and some inequalities for general cases are deduced. The paper ends with a Vizing-like conjecture relating the domination number of the cross product of G

On domination numbers of Cartesian produ
On domination numbers of Cartesian product of paths
โœ Sylvain Gravier; Michel Mollard ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 234 KB

We show the link between the existence of perfect Lee codes and minimum dominating sets of Cartesian products of paths and cycles. From the existence of such a code we deduce the asymptotical values of the domination numbers of these graphs.