使用Sage计算图的最小秩的界限的程序
Program for calculating bounds on the minimum rank of a graph using Sage
摘要：
单图$G$的最小秩被定义为所有对称实矩阵的最小可能秩，当$\{i,j\}$是$G$中的边时，其第$ij$个条目（对于$i\neq j$）不为零，否则为零。最小秩是一个很难计算的参数。然而，现在有一些已知的减少技术和界限，可以在计算机上编程;我们已经开发了一个程序，使用开源数学软件Sage来实现几种技术。在本文中，我们提供了这个程序的信源编码。
英文摘要：
The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. Minimum rank is a difficult parameter to compute. However, there are now a number of known reduction techniques and bounds that can be programmed on a computer; we have developed a program using the open-source mathematics software Sage to implement several techniques. In this note, we provide the source code for this program.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
