English

Using a new zero forcing process to guarantee the Strong Arnold Property

Combinatorics 2016-01-08 v1

Abstract

The maximum nullity M(G)M(G) and the Colin de Verdi\`ere type parameter ξ(G)\xi(G) both consider the largest possible nullity over matrices in S(G)\mathcal{S}(G), which is the family of real symmetric matrices whose i,ji,j-entry, iji\neq j, is nonzero if ii is adjacent to jj, and zero otherwise; however, ξ(G)\xi(G) restricts to those matrices AA in S(G)\mathcal{S}(G) with the Strong Arnold Property, which means X=OX=O is the only symmetric matrix that satisfies AX=OA\circ X=O, IX=OI\circ X=O, and AX=OAX=O. This paper introduces zero forcing parameters ZSAP(G)Z_{\mathrm{SAP}}(G) and Zvc(G)Z_{\mathrm{vc}}(G), and proves that ZSAP(G)=0Z_{\mathrm{SAP}}(G)=0 implies every matrix AS(G)A\in \mathcal{S}(G) has the Strong Arnold Property and that the inequality M(G)Zvc(G)ξ(G)M(G)-Z_{\mathrm{vc}}(G)\leq \xi(G) holds for every graph GG. Finally, the values of ξ(G)\xi(G) are computed for all graphs up to 77 vertices, establishing ξ(G)=Z(G)\xi(G)=\lfloor Z\rfloor(G) for these graphs.

Cite

@article{arxiv.1601.01341,
  title  = {Using a new zero forcing process to guarantee the Strong Arnold Property},
  author = {Jephian C. -H. Lin},
  journal= {arXiv preprint arXiv:1601.01341},
  year   = {2016}
}
R2 v1 2026-06-22T12:24:20.658Z