๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Nearly Completely Positive Graphs

โœ Scribed by Changqing Xu

Publisher
Springer
Year
2002
Tongue
English
Weight
88 KB
Volume
13
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Characterization of completely positive
Characterization of completely positive graphs
โœ Natalia Kogan; Abraham Berman ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 419 KB

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

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