Chordality of digraphs, signed graphs, and signed bigraphs
| dc.contributor.author | Ye, Ying Ying | |
| dc.contributor.supervisor | Huang, Jing | |
| dc.date.accessioned | 2025-07-25T22:28:50Z | |
| dc.date.available | 2025-07-25T22:28:50Z | |
| dc.date.issued | 2025 | |
| dc.degree.department | Department of Mathematics and Statistics | |
| dc.degree.level | Doctor of Philosophy PhD | |
| dc.description.abstract | Chordal graphs and chordal bigraphs enjoy beautiful characterizations, in terms of forbidden subgraphs, vertex or edge orderings, and tree-like representations. A digraph analogue of chordal graphs was introduced by Haskins and Rose. Unfortunately, a forbidden subdigraph characterization of chordal digraphs is not known and finding such a characterization seems to be a difficult problem. The study of chordal digraphs has been restricted to various classes of digraphs, such as semicomplete digraphs, quasi-transitive digraphs, extended semicomplete digraphs and locally semicomplete digraphs. In this dissertation, we introduce the new class of weakly quasi-transitive digraphs as a common generalization of semicomplete digraphs, quasi-transitive digraphs and symmetric digraphs. We show that weakly quasi-transitive digraphs can be obtained from these three classes of digraphs by substitutions. As a consequence, weakly quasi-transitive digraphs admit a recursive construction. This construction theorem allows us to find a forbidden subdigraph characterization of weakly quasi-transitive chordal digraphs. In addition, we use it to prove that the small quasi-kernel conjecture holds for weakly quasi-transitive digraphs. We extend the notion of chordality to signed graphs and signed bigraphs. Interestingly, chordal signed graphs are equivalent to strict chordal digraphs studied by Hell and Hernandez-Cruz. The forbidden subdigraph characterization of strict chordal digraphs can be translated to a forbidden subgraph characterization of chordal signed graphs. We give a forbidden subgraph characterization of chordal signed bigraphs. The forbidden subgraphs for chordal signed bigraphs are analogous to those for chordal signed graphs but the proofs are much more complicated and intriguing. | |
| dc.description.scholarlevel | Graduate | |
| dc.identifier.uri | https://hdl.handle.net/1828/22513 | |
| dc.language | English | eng |
| dc.language.iso | en | |
| dc.rights | Available to the World Wide Web | |
| dc.subject | graphs | |
| dc.subject | digraphs | |
| dc.subject | signed graphs | |
| dc.subject | chordal digraphs | |
| dc.subject | chordal signed bigraphs | |
| dc.subject | signed bigraphs | |
| dc.title | Chordality of digraphs, signed graphs, and signed bigraphs | |
| dc.type | Thesis |