Triangle-free graphs and completely positive matrices

DOI10.1007/s10100-021-00750-9OpenAlexW3158654568MaRDI QIDQ2155141

Naomi Shaked-Monderer, Abraham Berman

Publication date: 15 July 2022

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-021-00750-9

zbMATH Keywords

triangle-free graphcompletely positive matrixcp-rankcp factorizationminimal cp factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Cutting planes for semidefinite relaxations based on triangle-free subgraphs
• Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
• From seven to eleven: completely positive matrices with high cp-rank
• Copositive optimization -- recent developments and applications
• Spectra of graphs
• Characterization of completely positive graphs
• Combinatorial results on completely positive matrices
• On copositive matrices with -1, 9, 1 entries
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Rational factorizations of completely positive matrices
• On the Matrix Equation X′X = A
• Remarks on completey positive matrices
• Completely positive matrices associated withM-matrices
• Integer completely positive matrices of order two
• Copositive and Completely Positive Matrices
• On the number of CP factorizations of a completely positive matrix