Abstract
A classical problem in graph theory, known as the Italian domination number (also called Roman 2-domination number), involves assigning labels of \(0\) , \(1\) , or \(2\) to each node \(v\) . The goal is to ensure that every node with a label of \(0\) has a sum of labels of the nodes in its closed neighborhood that is \(2\) or greater. In computer systems, it is coined encompassing a robust cybersecurity strategy that will protect networks from potential threats, such as hacking, malware, and unauthorized access, by deploying security measures to provide the highest level of protection while reducing the misuse of resources. Toeplitz graphs are a special kind of graphs built over Toeplitz matrices from linear algebra, which are matrices with constant straight diagonal members. In this paper, we provide a detailed analysis regarding the Italian domination numbers for every Toeplitz graph family. We provide comprehensive results on Italian domination numbers across multiple graph families and identify the specific values at which the Italian domination number alters with increasing generator values.
