Bounding the CP-rank by graph parameters

DOI10.13001/1081-3810.3009zbMath1329.05200OpenAlexW765644413MaRDI QIDQ5502160

Naomi Shaked-Monderer

Publication date: 17 August 2015

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13001/1081-3810.3009

zbMATH Keywords

completely positive matricesouterplanar graphclique covering numbercp-rankmaximum size triangle free subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (2)

On the DJL conjecture for order 6 ⋮ Bounds for the completely positive rank of a symmetric matrix over a tropical semiring

This page was built for publication: Bounding the CP-rank by graph parameters