诱导子图中$d$维网格图的漏零传递及其关于Hopi矩形的应用
组合数学
2026-02-13 v2
摘要
我们研究维网格图诱导子图中的零传递和-漏零传递。利用-漏零要塞,我们证明结构结果表明对于,每个非空-漏零要塞在的诱导子图中与图的边界相交。这些结果给出一般界限,以及在特定情形下的精确值。以此为动机,我们引入基于整数格的Hopi矩形图的定义,将其作为的诱导子图。对于这一特定图族,证明零传递数等于最大零数,并完全描述的所有-漏零传递数。
引用
@article{arxiv.2509.21529,
title = {Leaky Zero Forcing on Induced Subgraphs of $d$-dimensional Grid Graphs with an Application to Hopi Rectangles},
author = {Ryan Moruzzi and Sagar Shah and Aaditeya Tripathi},
journal= {arXiv preprint arXiv:2509.21529},
year = {2026}
}
备注
Major revision: expanded from Hopi rectangle graphs to induced subgraphs of d-dimensional grid graphs; added structural results on \ell-leaky forts and corresponding bounds; reorganized and renumbered; Hopi rectangle section updated accordingly