牡丹图与蛛网图的零强制数
The Zero Forcing Numbers of Peony Graphs and Web Graphs
AI总结：
本文运用图结构论证研究两类多参数定义的无限复杂图（牡丹图与蛛网图）的零强制数。
摘要：
零强制的概念涉及一种动态着色过程：蓝色顶点促使白色顶点变为蓝色，其目标是在选择尽可能少的初始蓝色顶点的同时，将整个图强制变为蓝色。过去该领域的研究集中于结构性论证，所用方法从图的子结构，到局部与整体图结构之间的相互作用，各不相同。本文探讨在确定复杂图类的零强制数时如何运用这些结构概念，具体研究两个均由多个参数定义的无限图类。
英文摘要：
The concept of zero forcing involves a dynamic coloring process by which blue vertices cause white vertices to become blue, with the goal of forcing the entire graph blue while choosing as few as possible vertices to be initially blue. Past research in this area has focused on structural arguments, with approaches varying from graph substructures to the interplay between local and global graph structures. This paper explores the use of these structural concepts when determining the zero forcing number of complex classes of graphs, specifically two infinite classes of graphs each defined on multiple parameters.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
