Bounds for Minimum Semidefinite Rank from Superpositions and Cutsets

Authors

Jonathan Beagley
Lon Mitchell, University of South Florida St. PetersburgFollow
Sivaram Narayan
Eileen Radzwion
Sara Rimer
Rachel Tomasino
Jennifer Wolfe
Andrew Zimmer

SelectedWorks Author Profiles:

Lon Mitchell

Document Type

Article

Publication Date

2013

ISSN

0024-3795

Abstract

The real (complex) minimum semidefinite rank of a graph is the minimum rank among all real symmetric (complex Hermitian) positive semidefinite matrices that are naturally associated via their zero-nonzero pattern to the given graph. In this paper we give an upper bound on the minimum semidefinite rank of a graph when the graph is modified from the superposition of two graphs by cancelling some number of edges. We also provide a lower bound for the minimum semidefinite rank of a graph determined by a given cutset. When the complement of the cutset is a star forest these lower and upper bounds coincide and we can compute the minimum semidefinite rank in terms of smaller graphs. This result encompasses the previously known case in which the cut set has order two or smaller. Next we provide results for when the cut set has order three. Using these results we provide an example where the positive semidefinite zero forcing number is strictly greater than the maximum positive semidefinite nullity.

Publisher

Elsevier

Recommended Citation

Beagley, J., Mitchell, L. H., Narayan, S. K., Radzwion, E., Rimer, S. P., Tomasino, R., Wolfe, J., & Zimmer, A. M. (2013). Bounds for minimum semidefinite rank from superpositions and cutsets. Linear Algebra and its Applications, 438(10), 4041-4061. https://doi.org/10.1016/j.laa.2012.07.012.