Cordial labeling of some new and existing classes of graphs
LE3 .A278 2016
Bachelor of Science
Mathematics and Statistics
Mathematics & Statistics
A relaxation of harmonious and graceful labeling, cordial labeling was introduced by I. Cahit as a result of the frustrating lack of progress made on the Ringel-Kotzig conjecture. Researchers have since investigated the cordiality of a wide variety of classes of graphs while also introducing several methods to identify cordial graphs. In this thesis, we provide an in-depth discussion on how the construction of certain graphs can be used to investigate their cordiality. The efficiency of this method is highlighted through the investigation of the cordiality of some carefully chosen existing classes of graphs. We also introduce three new classes of graphs whose cordiality is investigated. Furthermore, we expand the results presented in three papers regarding particular structures built from different unions of a set of complete graphs; this is done by providing a near-complete investigation of the cordiality of these structures.
The author retains copyright in this thesis. Any substantial copying or any other actions that exceed fair dealing or other exceptions in the Copyright Act require the permission of the author.