Browsing by Subject "Forbidden subgraphs"
Now showing items 1-1 of 1
-
Graphs with sparsity order at most two: the complex case
(Taylor & Francis, 2017)The sparsity order of a (simple undirected) graph is the highest possible rank (over or ) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the positions ...