𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Factorization Index for Completely Positive Graphs

✍ Scribed by Xiao Dong Zhang; Jiong Sheng Li

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2002
Tongue
English
Weight
183 KB
Volume
18
Category
Article
ISSN
1439-7617

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

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

Cube factorizations of complete graphs
Cube factorizations of complete graphs
✍ Peter Adams; Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≑ 16 (mod 24), thus providing a new family of unifor