Chromatic Polynomials and Certain Classes of Graphs
| dc.contributor.author | Maphakela, Lesiba Joseph | |
| dc.contributor.supervisor | Mphako-Banda, G. | |
| dc.date.accessioned | 2024-10-17T12:02:03Z | |
| dc.date.available | 2024-10-17T12:02:03Z | |
| dc.date.issued | 2023 | |
| dc.description | A thesis submitted to the School of Mathematics in fulfillment of the requirements for the degree of Doctor of Philosophy School of Mathematics University of the Witwatersrand, Johannesburg 2023 | |
| dc.description.abstract | The chromatic polynomial of a graph has been widely studied in the literature. The focus of this research is on exploring the chromatic polynomial of specific graphs that result from the application of a join operation. The chromatic polynomial of a graph can be expressed in various forms; power form, tree form, factorial form and cycle form. The expressions in various forms, such as power form, tree form, and factorial form, have been subject to comprehensive investigation. However, it should be noted that the cycle form presents relative gaps that necessitate further exploration. This work builds upon the existing literature by engaging in a discussion of the coefficients of the chromatic polynomial of a graph expressed in cycle form. To achieve this objective, we commence by presenting the general formula of the chromatic polynomial in cycle form. Following this, we introduce an algorithm that computes the chromatic polynomial of a graph in cycle form. Additionally, we outline a method for converting the chromatic polynomial of a graph from its tree form into the cycle form. Furthermore, we determine the values of the first and second terms of the chromatic polynomial in its cycle form. This research also complements the well established knowledge of the chromatic polynomial of graphs resulting from the application of a join operation. Of particular interest, we explore the joins of various classes of graphs, including the join of a null graph, N1 with a graph G, which is known as the vertex join of graph G. Building upon this framework, we extend our analysis to encompass the join of a null graph, N2, with graph G. Similarly, we present results pertaining to the join of a complete graph, Kn, with a graph G. Significantly, we conduct a thorough comparative analysis of the chromatic equivalence class among these derived classes of graphs. Lastly, we discuss the chromatic uniqueness of these derived classes of graphs, alongside introducing variations to these derived graphs by deleting their edges and subgraphs. | |
| dc.description.submitter | MM2024 | |
| dc.faculty | Faculty of Science | |
| dc.identifier | https://orcid.org/ 0000-0002-7679-3858 | |
| dc.identifier.citation | Maphakela, Lesiba Joseph. (2023). Chromatic Polynomials and Certain Classes of Graphs [PhD thesis, University of the Witwatersrand, Johannesburg]. WireDSpace.https://hdl.handle.net/10539/41682 | |
| dc.identifier.uri | https://hdl.handle.net/10539/41682 | |
| dc.language.iso | en | |
| dc.publisher | University of the Witwatersrand, Johannesburg | |
| dc.rights | © 2023 University of the Witwatersrand, Johannesburg. All rights reserved. The copyright in this work vests in the University of the Witwatersrand, Johannesburg. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of University of the Witwatersrand, Johannesburg. | |
| dc.rights.holder | University of the Witwatersrand, Johannesburg | |
| dc.school | School of Mathematics | |
| dc.subject | Bispoke | |
| dc.subject | Bivertex join | |
| dc.subject | Chromatic polynomial | |
| dc.subject | Chromatically equivalent | |
| dc.subject | Clique separable | |
| dc.subject | Graph invariant | |
| dc.subject | Graph operation | |
| dc.subject | Hamilton cycle | |
| dc.subject | Induced subgraph | |
| dc.subject | UCTD | |
| dc.subject | Join | |
| dc.subject | Repebispoke | |
| dc.subject.other | SDG-4: Quality education | |
| dc.title | Chromatic Polynomials and Certain Classes of Graphs | |
| dc.type | Thesis |