Italian Domination Number of Strong Product of Cycles

被引：0

作者：

Wei, Liyang ^{[1
]}

Li, Feng ^{[2
]}

机构：

[1] Computer College, Qinghai Normal University, CO, Xining,810000, China

[2] Computer College, Qinghai Normal University, CO, Xining,810000, China

来源：

IAENG International Journal of Applied Mathematics | 2024年 / 54卷 / 04期

基金：

中国国家自然科学基金;

关键词：

D O I：

暂无

中图分类号：

O144 [集合论]; O157 [组合数学（组合学）];

学科分类号：

070104 ;

摘要：

The investigation into the domination problem and the associated subset problem of graphs is a focal point in graph theory research, sparking widespread interest and extensive exploration. This paper mainly studies the Italian domination of the strong product of two cycles. By constructing recursive Italian dominating functions, a well-defined bound for the Italian domination number in Cn ⊗ Cm is obtained. Furthermore, through mathematical derivation and proof, the precise Italian domination number of C3 ⊗ Cm is determined. © (2024), (International Association of Engineers). All Rights Reserved.

引用

页码：791 / 796