Abstract.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 14, 1999; revised version: October 5, 2000
Rights and permissions
About this article
Cite this article
Xu, C. Nearly Completely Positive Graphs. AAECC 13, 1–8 (2002). https://doi.org/10.1007/s002000100076
Issue Date:
DOI: https://doi.org/10.1007/s002000100076