On chordal digraphs and semi-strict chordal digraphs

Simple item page
dc.contributor.authorYe, Ying Ying
dc.contributor.supervisorHuang, Jing
dc.date.accessioned2019-08-29T18:16:24Z
dc.date.available2019-08-29T18:16:24Z
dc.date.copyright2019en_US
dc.date.issued2019-08-29
dc.degree.departmentDepartment of Mathematics and Statisticsen_US
dc.degree.levelMaster of Science M.Sc.en_US
dc.description.abstractChordal graphs are an important class of perfect graphs. The beautiful theory surrounding their study varies from natural applications to elegant characterizations in terms of forbidden subgraphs, subtree representations, vertex orderings, and to linear time recognition algorithms. Haskins and Rose introduced the class of chordal digraphs as a digraph analogue of chordal graphs. Chordal digraphs can be defined in terms of vertex orderings and several results about chordal graphs can be extended to chordal digraphs. However, a forbidden subdigraph characterization of chordal digraphs is not known and finding such a characterization seems to be a difficult problem. Meister and Telle studied semi-complete chordal digraphs and gave a forbidden subdigraph characterization of this class of digraphs. In this thesis, we study chordal digraphs within the classes of quasi-transitive, extended semi-complete, and locally semi-complete digraphs. For each of these classes we obtain a forbidden subdigraph characterization of digraphs which are chordal. We also introduce in this thesis a new variant of chordal digraphs called semi-strict chordal digraphs. We obtain a forbidden subdigraph characterization of semi-strict chordal digraphs for each of the classes of semi-complete, quasi-transitive, extended semi-complete, and locally semi-complete digraphs.en_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/11083
dc.languageEnglisheng
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.subjectchordal digraphsen_US
dc.subjectsemi-strict chordal digraphsen_US
dc.subjectsemi-complete digraphsen_US
dc.subjectlocally semi-complete digraphsen_US
dc.subjectquasi-transitive digraphsen_US
dc.subjectextended-semi-complete digraphsen_US
dc.titleOn chordal digraphs and semi-strict chordal digraphsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Ye_YingYing_MSc_2019.pdf
Size:
382.68 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
Theses (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.