Nearly Completely Positive Graphs | Applicable Algebra in Engineering, Communication and Computing Skip to main content
Springer Nature Link
Log in

Nearly Completely Positive Graphs

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

  1. Department of Mathematics, Anhui University, Hefei, Anhui 230039 P. R. China (e-mail: cqxu@mars.ahu.edu.cn), , , , , , CN

    Changqing Xu

Authors
  1. Changqing Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: December 14, 1999; revised version: October 5, 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000100076

Search

Navigation