Corrigendum to: ``SPN graphs: when copositive = SPN

DOI10.1016/J.LAA.2017.12.019zbMATH Open1430.05127arXiv1712.05115OpenAlexW2779766539MaRDI QIDQ1690691FDOQ1690691

Authors: Naomi Shaked-Monderer 

Publication date: 12 January 2018

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

Abstract: In this corrigendum, an error in the proof of a theorem in [Linear Algebra and its Applications 509 (2016) 82--113] is pointed out. This theorem states that every graph $T_n$ consisting of $n-2$ triangles sharing a common base is SPN. An alternative proof is given here for the case $n=5$, but for all $n>5$ it remains open whether $T_n$ is SPN. As a result, the question whether $K_{2,n}$, $n>4$, is SPN also remains open.

Full work available at URL: https://arxiv.org/abs/1712.05115

Recommendations

• The triangle graph \(T_6\) is not SPN
• Corrigendum to: ``On the enumeration of a class of toroidal graphs
• Erratum: An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\) [Discrete Mathematics 187 (1998) 195-209]
• Erratum to ``The lollipop graph is determined by its \(Q\)-spectrum
• SPN graphs

zbMATH Keywords

copositive matricesSPN matrices

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (05C99) Sign pattern matrices (15B35)

Cites Work

• Irreducible elements of the copositive cone
• SPN graphs: when copositive = SPN

Cited In (2)

• SPN graphs: when copositive = SPN
• The triangle graph \(T_6\) is not SPN

This page was built for publication: Corrigendum to: ``SPN graphs: when copositive = SPN

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