On completely positive graphs and their complements

DOI10.1016/S0024-3795(03)00419-1zbMath1019.05043OpenAlexW2046469115MaRDI QIDQ1406281

Felix Goldberg

Publication date: 9 September 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(03)00419-1

zbMATH Keywords

spectral radiuscompletely positive matricescompletely positive graphsNordhaus-Gaddum type theorems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of completely positive graphs
• Lower bounds for the clique and the chromatic numbers of a graph
• Combinatorial results on completely positive matrices
• Large cycles in graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• On Complementary Graphs
• On maximal paths and circuits of graphs
• Bipartite completely positive matrices
• Line perfect graphs
• Sufficient Conditions for Circuits in Graphs^†