1993 | OriginalPaper | Buchkapitel
Completely Positive Graphs
verfasst von : Abraham Berman
Erschienen in: Combinatorial and Graph-Theoretical Problems in Linear Algebra
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The paper describes a qualitative study of completely positive matrices. The main result isTheorem. A graph is completely positive if and only if it does not contain an odd cycle of length greater than 4.This theorem is a result of works with Danny Hershkowitz, Bob Grone and Nataly Kogan. The paper is divided into three parts: definitions, a sketch of the proof, and questions.