Triangle-free graphs and completely positive matrices
From MaRDI portal
Publication:2155141
Recommendations
Cites work
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Characterization of completely positive graphs
- Combinatorial results on completely positive matrices
- Completely positive matrices associated withM-matrices
- Copositive and completely positive matrices
- Copositive optimization -- recent developments and applications
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- From seven to eleven: completely positive matrices with high cp-rank
- Integer completely positive matrices of order two
- On copositive matrices with -1, 9, 1 entries
- On the Matrix Equation X′X = A
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the number of CP factorizations of a completely positive matrix
- Rational factorizations of completely positive matrices
- Remarks on completey positive matrices
- Spectra of graphs
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
Cited in
(5)
This page was built for publication: Triangle-free graphs and completely positive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155141)