@article{578a9877232d4ad4a3d9efe092eca3df,
title = "On the minimum semidefinite rank of a simple graph",
abstract = "The minimum semidefinite rank (msr) of a graph is defined to be the minimum rank among all positive semidefinite matrices whose zero/ nonzero pattern corresponds to that graph. We recall some known facts and present new results, including results concerning the effects of vertex or edge removal from a graph on msr.",
keywords = "Graph of a matrix, Positive semidefinite, Rank, Vector representation",
author = "Matthew Booth and Philip Hackney and Benjamin Harris and Johnson, {Charles R.} and Margaret Lay and Lenker, {Terry D.} and Mitchell, {Lon H.} and Narayan, {Sivaram K.} and Amanda Pascoe and Sutton, {Brian D.}",
note = "Funding Information: The authors thank the referee for many helpful comments. B. Harris, M. Lay, S. Narayan and A. Pascoe participated in an NSF-REU program at Central Michigan University during the summer of 2004 and were supported in part by NSF grant DMS 02-43674. M. Booth, C. Johnson and B. Sutton participated in and NSF-REU program at the College of William and Mary in 2003 and were supported in part by NSF grant DMS 99-87803.",
year = "2011",
month = may,
doi = "10.1080/03081080903542791",
language = "English",
volume = "59",
pages = "483--506",
journal = "Linear and Multilinear Algebra",
issn = "0308-1087",
publisher = "Linear and Multilinear Algebra",
number = "5",
}