Scholarlink

<p>We consider bounds on maximum nullity of a graph via transversal numbers of compatible collections of forts. Results include generalizations of theorems from symmetric to combinatorially symmetric matrices, special bases of matrix nullspaces derived from transversal sets, and examples of issues that arise when considering only minimal forts and how to avoid them. We also show an important difference between constructing symmetric and combinatorially symmetric matrices associated to a graph whose nullspaces are supported on collections of disjoint forts.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Compatible Forts and Maximum Nullity of a Graph

  • 期刊论文

  • 发表日期：

    2025年4月11日

查看全文
  • Veronika Furst,
  • John Hutchens,
  • Lon Mitchell,
  • Yaqi Zhang

摘要

We consider bounds on maximum nullity of a graph via transversal numbers of compatible collections of forts. Results include generalizations of theorems from symmetric to combinatorially symmetric matrices, special bases of matrix nullspaces derived from transversal sets, and examples of issues that arise when considering only minimal forts and how to avoid them. We also show an important difference between constructing symmetric and combinatorially symmetric matrices associated to a graph whose nullspaces are supported on collections of disjoint forts.