Chordally signed graphs
From MaRDI portal
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.
Recommendations
- Chordal graphs
- Graphoidal signed graphs
- scientific article; zbMATH DE number 6315767
- The signature of chordal graphs and cographs
- On signed cordial graph
- scientific article; zbMATH DE number 4043881
- scientific article; zbMATH DE number 1533810
- On the chordality of a graph
- A generalization of chordal graphs
- Polarity of chordal graphs
Cites work
- Glossary of signed and gain graphs and allied areas
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- On local balance and \(n\)-balance in signed graphs
- On perfect switching classes
- On the notion of balance of a signed graph
- On the null-homotopy of bridged graphs
- Signed analogs of bipartite graphs
- Topics in Intersection Graph Theory
- Vertices of Localized Imbalance in a Biased Graph
Cited in
(6)- Edges and vertices in a unique signed circle in a signed graph
- For which graphs does every edge belong to exactly two chordless cycles?
- Restricted unimodular chordal graphs
- scientific article; zbMATH DE number 6315767 (Why is no real title available?)
- Polarity of chordal graphs
- A characterization of signed graphs with generalized perfect elimination orderings
This page was built for publication: Chordally signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613353)
