Bounding the CP-rank by graph parameters

DOI10.13001/1081-3810.3009MaRDI QIDQ5502160zbMATH OpenOpenAlexFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

outerplanar graphcompletely positive matricesclique covering numbercp-rankmaximum size triangle free subgraph

Mathematics Subject Classification ID

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

Recommendations

• Minimal \(cp\) rank
• On the cp-rank and minimal cp factorizations of a completely positive matrix
• On the number of CP factorizations of a completely positive matrix
• Bounds for the completely positive rank of a symmetric matrix over a tropical semiring
• A note on upper bounds on the cp-rank

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502160)