The n-antiprism graph is not widely studied as a class of graphs in graph theory
hence there is not much literature.
We begin by de ning the n-antiprism graph and discussing properties, which we
prove in the thesis, and which have not been previously presented in graph
theory literature. Some of our signi cant results include proving that an
n-antiprism is 4-connected, 4-edge connected and has a pathwidth of 4.
A highly studied area of graph theory is the chromatic polynomial of graphs. We
investigate the chromatic polynomial of the antiprism graph and attempt to nd
explicit expressions for the chromatic polynomial of the antiprism graph. We
express this chromatic polynomial in several forms to discover the best-suited
form.
We then explore the Tutte polynomial and search for an explicit expression of
the Tutte polynomial of the antiprism graph. Using the relationship between a
graph and its dual graph, we provide an iterative expression of the Tutte
polynomial of the antiprism graph.
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:wits/oai:wiredspace.wits.ac.za:10539/14853 |
| Date | 02 July 2014 |
| Creators | Bukasa, Deborah Kembia |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf, application/pdf |
Page generated in 0.0016 seconds