Nearly Completely Positive Graphs.
A non-cp graph G is called nearly vertex (edge) cp if any subgraph of G obtained by deleted a vertex (an edge) of G is completely positive. This paper presents necessary and sufficient conditions for any doubly nonnegative matrix realization A of a nearly cp graph to be completely positive.
| 发表在: | Applicable algebra in engineering, communication and computing. 13, 1 (2002). |
|---|---|
| 主要作者: | |
| 格式: | 文件 |
| 语言: | English |
| 主题: |