优化最小意大利支配集的图论方法
A Graph Theoretical Approach to Optimizing Minimum Italian Domination Sets
浏览论文内容
中文总结 AI 辅助
本文针对Toeplitz图族，分析意大利支配数的变化规律，为基于该问题的网络安全策略提供图论层面的支撑。
中文摘要 AI 辅助
图论中的经典问题意大利支配数（又称罗马2-支配数），涉及为每个节点v分配0、1或2的标签，目标是确保每个标签为0的节点，其闭邻域内节点标签之和不小于2。在计算机系统中，该问题被用作一种稳健的网络安全策略，通过部署安全措施提供最高级别的保护，同时减少资源滥用，以防范黑客攻击、恶意软件和未授权访问等潜在威胁。Toeplitz图是一类特殊的图，基于线性代数中的Toeplitz矩阵（即具有恒定直对角线元素的矩阵）构建。本文对所有Toeplitz图族的意大利支配数进行了详细分析，提供了多个图族意大利支配数的综合结果，并确定了随着生成元值增大，意大利支配数发生变化的具体取值。
英文摘要
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 cyber security 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.
