|
|||||
|
|
Linearly independent vertices and minimum semidefinite rank |
|
| Authors: | Philip Hackney Margaret Lay Lon H Mitchell Amanda Pascoe |
| Institution: | a Department of Mathematics, Purdue University, West Lafayette, IN 47907-2067, United States b Department of Mathematics, Brown University, Providence, RI 02912, United States c Department of Mathematics and Computer Science, Grinnell College, Grinnell, IA 50112-1690, United States d Department of Mathematics, Virginia Commonwealth University, Richmond, VA 23284-2014, United States e Department of Mathematics, Central Michigan University, Mount Pleasant, MI 48859, United States f Department of Mathematics, Furman University, Greenville, SC 29613-1148, United States |
| Abstract: | We study the minimum semidefinite rank of a graph using vector representations of the graph and of certain subgraphs. We present a sufficient condition for when the vectors corresponding to a set of vertices of a graph must be linearly independent in any vector representation of that graph, and conjecture that the resulting graph invariant is equal to minimum semidefinite rank. Rotation of vector representations by a unitary matrix allows us to find the minimum semidefinite rank of the join of two graphs. We also improve upon previous results concerning the effect on minimum semidefinite rank of the removal of a vertex. |
| Keywords: | 15A18 15A57 05C50 |
| 本文献已被 ScienceDirect 等数据库收录！ | |