The chromatic polynomials of the q-analogue of certain graph operations
| dc.contributor.author | Ojarikreh, Onoriode Samuel | |
| dc.date.accessioned | 2019-04-05T12:00:51Z | |
| dc.date.available | 2019-04-05T12:00:51Z | |
| dc.date.issued | 2018 | |
| dc.description | A thesis submitted in fulfilment of the requirements for the degree of Master of Science, University of the Witwatersrand, Johannesburg, 2018 | en_ZA |
| dc.description.abstract | In this dissertation, we start by giving basic definitions in graph theory and some classes of graphs which are relevant in this work. We then introduce the chromatic polynomial of a graph which is the main focus of this dissertation. In addition, we discuss some properties of a graph, and the chromatic polynomials which are relevant to this work. In particular, explicit expression of chromatic polynomials of certain classes of graphs are presented. Certain graph operations and the chromatic polynomials of the resultant graphs are discussed. Finally, we introduce the 2-vertex join of a graph and we study its chromatic polynomial, in particular we give the explicit expression of the flow polynomial of the 2-vertex join of a path Pn. | en_ZA |
| dc.description.librarian | XL2019 | en_ZA |
| dc.format.extent | Online resource (59 leaves) | |
| dc.identifier.citation | Ojarikreh, Onoriode Samuel, (2018) The chromatic polynomials of the q-analogue of certain graph operations, University of the Witwatersrand, Johannesburg, https://hdl.handle.net/10539/26703. | |
| dc.identifier.uri | https://hdl.handle.net/10539/26703 | |
| dc.language.iso | en | en_ZA |
| dc.subject.lcsh | Graph theory | |
| dc.subject.lcsh | Graph coloring | |
| dc.title | The chromatic polynomials of the q-analogue of certain graph operations | en_ZA |
| dc.type | Thesis | en_ZA |