Italian Domination Number for Strong Product of Cycles and Paths

Liyang Wei and Feng Li

Journal of Mathematics, 2025, vol. 2025, 1-10

Abstract: This paper mainly considers the Italian domination number for strong product of cycles and paths. After constructing some recursive Italian dominating functions, we derive the upper bounds for the Italian domination number of strong product of cycles and paths. Then, we propose a bagging approach and a partitioning approach to study the lower bounds for the Italian domination number of strong product of cycles and paths. At present, there are few studies on the Italian domination number, especially for large graphs such as strong product graphs. Hence, the study of Italian domination number in strong product graphs can not only enrich the research results of graph domination theory but also provide theoretical support and foundation for large-scale Internet networks.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2025/5558033.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2025/5558033.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5558033

DOI: 10.1155/jom/5558033

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().