首页|Italian Domination of Strong Product of Two Paths
Italian Domination of Strong Product of Two Paths
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
维普
The domination problem of graphs is an important issue in the field of graph theory.This paper mainly considers the Italian domination number of the strong product between two paths.By constructing recursive Italian dominating functions,the upper bound of its Italian domination number is obtained,and then a partition method is proposed to prove its lower bound.Finally,this paper yields a sharp bound for the Italian domination number of the strong product of paths.
万方数据
维普
