Program for calculating bounds on the minimum rank of a graph using Sage
| dc.creator | DeLoss, Laura | |
| dc.creator | Grout, Jason | |
| dc.creator | McKay, Tracy | |
| dc.creator | Smith, Jason | |
| dc.creator | Tims, Geoff | |
| dc.date | 2008-12-09 | |
| dc.date.accessioned | 2026-07-07T12:10:45Z | |
| dc.date.available | 2026-07-07T12:10:45Z | |
| dc.description | 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. | |
| dc.description | 30 pages, 1 Sage program | |
| dc.identifier | https://arxiv.org/abs/0812.1616 | |
| dc.identifier | http://arxiv.org/abs/0812.1616 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/210022 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C50; 15A03 | |
| dc.title | Program for calculating bounds on the minimum rank of a graph using Sage | |
| dc.type | text |