Advanced search
Publication Cover
Linear and Multilinear Algebra Volume 63, 2015 - Issue 4
Submit an article Journal homepage
104
Views
0
CrossRef citations to date
0
Altmetric
Articles

Bounds on minimum semidefinite rank of graphs

Sivaram K. NarayanDepartment of Mathematics, Central Michigan University, Mount Pleasant, MI, USA.Correspondence[email protected]
&
Yousra SharawiDepartment of Mathematics & Statistics, Sultan Qaboos University, Muscat, Sultanate of Oman.
Pages 774-787 | Received 21 Oct 2012, Accepted 24 Feb 2014, Published online: 11 Jun 2014

References

  • Horn RA, Johnson CR. Matrix analysis. 2nd ed. New York (NY): Cambridge University Press; 2013.
  • Hackney P, Harris B, Lay M, Mitchell LH, Narayan SK, Pascoe A. Linearly independent vertices and minimum semidefinite rank. Linear Algebra Appl. 2009;431:1105–1115.
  • Barioli F, Barrett W, Fallat SM, Tracy Hall H, Hogben L, Shader B, van den Driessche P, van der Holst H. Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 2010;433:401–411.
  • Nylen PM. Minimum-rank matrices with prescribed graph. Linear Algebra Appl. 1996;248:303–316.
  • Berman A, Friedland S, Hogben L, Rothblum UG, Shader B. An upper bound for the minimum rank of a graph. Linear Algebra Appl. 2008;429:1629–1638.
  • Booth M, Hackney P, Harris B, Johnson CR, Lay M, Lenker T, Mitchell LH, Narayan SK, Pascoe A, Sutton BD. On the minimum semidefinite rank of a simple graph. Linear Multilinear Algebra. 2011;59:483–506.
  • Booth M, Hackney P, Harris B, Johnson CR, Lay M, Mitchell LH, Narayan SK, Pascoe A, Steinmetz K, Sutton BD, Wang W. On the minimum rank among rositive semidefinite matrices with a given graph. SIAM J. Matrix Anal. Appl. 2008;30:731–740.
  • Peters Travis. Positive semidefinite maximum nullity and zero forcing number. Elec. J. Linear Algebra. 2012;23:815–830.
  • van der Holst H. Graphs whose positive semidefinite matrices have nullity at most two. Linear Algebra Appl. 2003;375:1–11.
  • Lovasz L, Saks M, Schrijver A. Orthogonal representations and connectivity of graphs. Linear Algebra Appl. 1989;114:439–454.
  • Lovasz L, Saks M, Schrijver A. A correction: “orthogonal representations and connectivity of graphs”. Linear Algebra Appl. 2000;313:101–105.
  • Mitchell LH. On the graph complement conjucture for minimum semidefinite rank. Linear Algebra Appl. 2011;435:1311–1314.
  • Mitchell LH, Narayan SK, Zimmer AM. Lower bounds in minimum rank problems. Linear Algebra Appl. 2010;432:430–440.
  • West DB. Introduction to graph theory. 2nd ed. Upper Saddle River (NJ): Prentice Hall; 2001.
  • Merris R. A survey of graph laplacians. Linear Multilinear Algebra. 1995;39:19–31.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.