Characterization of completely positive graphs

DOI10.1016/0012-365X(93)90374-3zbMATH Open0783.05071OpenAlexW2088536697WikidataQ126789352 ScholiaQ126789352MaRDI QIDQ685688FDOQ685688

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

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

zbMATH Keywords

characterizationcyclecompletely positive graphs

Mathematics Subject Classification ID

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

Cites Work

• Combinatorial results on completely positive matrices
• Nonnegative factorization of positive semidefinite nonnegative matrices
• On the Matrix Equation X′X = A
• Title not available (Why is that?)
• Bipartite completely positive matrices
• Line perfect graphs
• Title not available (Why is that?)

Cited In (35)

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

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)