首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On domination numbers of Cartesian product of paths
Authors:Sylvain Gravier  Michel Mollard  
Institution:

a Laboratoire Leibniz-IMAG (LSD2), University J. Fourier. BP 53, 38041, Grenoble Cedex 9, France

b CNRS. Laboratoire Leibniz-IMAG (LSD2). BP 53, 38041, Grenoble Cedex 9, France

Abstract: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.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号