Using a new zero forcing process to guarantee the Strong Arnold Property
Combinatorics
2016-01-08 v1
Abstract
The maximum nullity and the Colin de Verdi\`ere type parameter both consider the largest possible nullity over matrices in , which is the family of real symmetric matrices whose -entry, , is nonzero if is adjacent to , and zero otherwise; however, restricts to those matrices in with the Strong Arnold Property, which means is the only symmetric matrix that satisfies , , and . This paper introduces zero forcing parameters and , and proves that implies every matrix has the Strong Arnold Property and that the inequality holds for every graph . Finally, the values of are computed for all graphs up to vertices, establishing 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}
}