Nearly completely positive graphs

DOI10.1007/S002000100076MaRDI QIDQ1598119zbMATH OpenOpenAlexFDO

Authors Changqing Xu

Publication date 29 May 2002

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000100076

zbMATH Keywords

factorization indexdoubly nonnegative matrixcompletely positive graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A note on completely positive graphs. II
• A note on completely positive graphs
• Completely positive matrices of order \(5\) with a nearly \(\widehat{CP} \)-graph
• Characterization of completely positive graphs
• scientific article; zbMATH DE number 1910735

Cited in

(8)

• Characterization of completely positive graphs
• Graphs with positive spectrum
• Minimal \(cp\) rank
• Completely positive matrices of order \(5\) with a nearly \(\widehat{CP} \)-graph
• Completely positive matrices.
• A note on completely positive graphs. II
• Nearly positive matrices
• Completely positive matrices of order five

This page was built for publication: Nearly completely positive graphs

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