首页|On the minimum semidefinite rank of signed graphs
On the minimum semidefinite rank of signed graphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
The (real) minimum semidefinite rank of a signed graph is the minimum rank among all real symmetric positive semidefinite matrices associated to the graph and having the given sign pattern. We give a new lower bound for the minimum semidefinite rank of a signed multigraph and show it equals a new upper bound for signed complete multigraphs. This allows a complete characterization of signed multigraphs with minimum semidefinite rank two. We also determine the minimum semidefinite rank of all signed wheel graphs. (C) 2022 Elsevier Inc. All rights reserved.
Minimum semidefinite rankSigned graphsComplete signed multigraphs
NSTL
Elsevier
