中文

诱导子图中$d$维网格图的漏零传递及其关于Hopi矩形的应用

组合数学 2026-02-13 v2

摘要

我们研究dd维网格图诱导子图中的零传递和\ell-漏零传递。利用\ell-漏零要塞,我们证明结构结果表明对于2d1\ell \le 2d-1,每个非空\ell-漏零要塞在Pn1PndP_{n_1}\square\cdots\square P_{n_d}的诱导子图中与图的边界相交。这些结果给出一般界限,以及在特定情形下的精确值。以此为动机,我们引入基于整数格的Hopi矩形图HD(a,b)HD(a,b)的定义,将其作为Pa+bPa+b P_{a+b}\square P_{a+b}的诱导子图。对于这一特定图族,证明零传递数等于最大零数,并完全描述1\ell \ge 1的所有\ell-漏零传递数。

关键词

引用

@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