Characterization of completely positive graphs

DOI10.1016/0012-365X(93)90374-3MaRDI QIDQ685688zbMATH OpenOpenAlexWikidataFDO

Authors Natalia Kogan, A. Berman

Publication date 24 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90374-3

zbMATH Keywords

characterizationcyclecompletely positive graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 510852
• A note on completely positive graphs
• On completely positive graphs and their complements
• A note on completely positive graphs. II
• Nearly completely positive graphs
• Characterizing graphs with fully positive semidefinite \(Q\)-matrices
• scientific article; zbMATH DE number 1292546
• scientific article; zbMATH DE number 3906545
• A complete characterization of graphs with exactly two positive eigenvalues
• Graph products of completely positive maps

Cites work

• scientific article; zbMATH DE number 3140514 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• Bipartite completely positive matrices
• Combinatorial results on completely positive matrices
• Line perfect graphs
• Nonnegative factorization of positive semidefinite nonnegative matrices
• On the Matrix Equation X′X = A

Cited in

(35)

• Completely positive house matrices
• Decreasing diagonal elements in completely positive matrices
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• On completely positive graphs and their complements
• SPN completable graphs
• Remarks on completey positive matrices
• Computable representations for convex hulls of low-dimensional quadratic forms
• A characterisation of common diagonal stability over cones
• Characterizing and generalizing cycle completable graphs
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Nearly completely positive graphs
• On \(\{0,1\}\) CP tensors and CP pseudographs
• Complete positivity of matrices of special form
• Completely positive matrices: real, rational, and integral
• Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
• Separating doubly nonnegative and completely positive matrices
• Minimal \(cp\) rank
• CP rank of completely positive matrices of order 5
• Completely positive semidefinite rank
• Triangle-free graphs and completely positive matrices
• Positive Fork Graph Calculus
• Completely positive matrices of order \(5\) with a nearly \(\widehat{CP} \)-graph
• Factorization index for completely positive graphs
• Completely positive matrices and positivity of least squares solutions
• Matrices attaining the minimum semidefinite rank of a chordal graph
• On positive hypergraphs
• Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression
• A note on the computation of the CP-rank
• \(5 \times 5\) completely positive matrices
• \(\{0,1\}\) completely positive tensors and multi-hypergraphs
• Completely positive matrices associated withM-matrices
• A note on completely positive graphs
• A note on completely positive graphs. II
• Completely positive graphs and entanglement of quantum states
• Completely positive matrices of order five

This page was built for publication: Characterization of completely positive graphs

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