Italian Domination of Strong Product of Two Paths  

两条路径强乘积图的意大利控制数

作　　者：WEI Li-yang LI Feng 魏丽阳;李峰

机构地区：[1]Computer College,Qinghai Normal University,Xining 810000,China

出　　处：《Chinese Quarterly Journal of Mathematics》2024年第3期221-234,共14页数学季刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant No.11551002);The Natural Science Foundation of Qinghai Province(Grant No.2019-ZJ-7093).

摘　　要：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.

关 键 词：Partitioning approach Roman domination Italian domination Strong product 

分 类 号：O157.5[理学—数学]