The Minimum Rank of Schemes on Graphs
Let G be an undirected graph on n vertices and let S(G) be the class of all real-valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let V = {1, 2, . . . , n} be the vertex set of G. A scheme on G is a function f : V → {0...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
BYU ScholarsArchive
2014
|
| Subjects: | |
| Online Access: | https://scholarsarchive.byu.edu/etd/4402 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=5401&context=etd |