A note on completely positive graphs
From MaRDI portal
An \(n\times n\) matrix \(A\) is said to be completely positive if there exist non-negative column vectors \(b_1, \ldots, b_m\) such that \(A=b_1b_1^\top+\cdots+b_mb_m^\top\). A necessary and sufficient condition for a doubly non-negative matrix realization of a cycle to be completely positive is given.
Recommendations
Cited in
(24)- Complete positivity
- Completely positive matrices with a book-graph
- On completely positive graphs and their complements
- Nearly completely positive graphs
- On \(\{0,1\}\) CP tensors and CP pseudographs
- Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
- Triangle-free graphs and completely positive matrices
- A note on completely positive graphs. II
- A Note on Positively Spanning Sets
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- A note on totally-omnitonal graphs
- Positive Fork Graph Calculus
- Bipartite completely positive matrices
- Critical Graphs for the Positive Definite Completion Problem
- scientific article; zbMATH DE number 1292546 (Why is no real title available?)
- scientific article; zbMATH DE number 510852 (Why is no real title available?)
- Completely positive matrices associated withM-matrices
- scientific article; zbMATH DE number 1475210 (Why is no real title available?)
- scientific article; zbMATH DE number 1843997 (Why is no real title available?)
- scientific article; zbMATH DE number 850230 (Why is no real title available?)
- Completely positive matrices of order five
- Completely positive house matrices
- Characterization of completely positive graphs
- Distance matrix of a class of completely positive graphs: determinant and inverse
This page was built for publication: A note on completely positive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721915)
