Chordally signed graphs (Q1613353)

A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles. Two characterizations of chordally signed graphs are produced. In addition, if the underlying graph has at most two maximal complete subgraphs, an effective criteria of recognition of chordally signed graphs is given.