✦ LIBER ✦

Characterization of completely positive graphs

✍ Scribed by Natalia Kogan; Abraham Berman

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 419 KB
Volume: 114
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90374-3

No coin nor oath required. For personal study only.

✦ Synopsis

We complete the proof that a graph G is completely positive (every doubly nonnegative matrix A, with G(A) = G, is completely positive) if and only if it has no odd cycle of length greater than 4. i#j, aij#O}. Definition 1.3. A graph G is completely positizje if every doubly nonnegative matrix A with G(A) = G is completely positive.

📜 SIMILAR VOLUMES

Nearly Completely Positive Graphs

✍ Changqing Xu 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 88 KB

Factorization Index for Completely Posit

Factorization Index for Completely Positive Graphs

✍ Xiao Dong Zhang; Jiong Sheng Li 📂 Article 📅 2002 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 183 KB

On completely positive graphs and their

On completely positive graphs and their complements

✍ Felix Goldberg 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 81 KB

In this paper we establish two results concerning completely positive graphs and their complements: (1) the complement of a completely positive graph on n 9 vertices is not completely positive; (2) the spectral radius of the adjacency matrix of a completely positive graph on n 6 vertices is at most

Completely positive matrices with a book

Completely positive matrices with a book-graph

✍ Francesco Barioli 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A new class of graphs, called "book-graphs", extending the class of completely positive graphs is defined. Necessary and sufficient conditions for the complete positivity of a matrix with graph in this class are given. The main questions concerning completely positive matrices with cyclic graph are

Two characterizations of interchange gra

Two characterizations of interchange graphs of complete m-partite graphs

✍ Curtis R. Cook 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 564 KB

A graph G is m-partite if its points can be partitioned into m subsets Yl, . . . . Vm such that every line joins a point in Vi with a point in Vi, i + j. A complete m-partite graph contains every line joining Vi with V-. A complete graph Kp has every pair of its p points adjacent. The nth interchang

Decomposition of Completely Positive Map

Decomposition of Completely Positive Maps

✍ Michael Paul 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

## Abstract The paper is concerned with completely positive maps on the algebra of unbounded operatore __L__+(__D__) and on its completion __L__(D, D^+^). A decomposition theorem for continuous positive functionals is proved in [Tim. Loef.), and [Scholz 91] contains a generalization to maps into op