Triangulated ladders, polynomials and links.

Simple item page
dc.date.accessioned2024-11-22T12:18:48Z
dc.date.accessioned2025-12-22T12:01:29Z
dc.date.available2024-11-22T12:18:48Z
dc.date.created2024-11-22T12:18:48Z
dc.date.issued2007-01-01
dc.description.abstractIn this thesis we study three graph polynomials, namely, the chromatic polynomial, the Tutte polynomial and the coboundary polynomial. We define a class of graphs which we call triangulated ladder and give some of its properties. Then we find an explicit expression of the chromatic polynomial for this class of graphs. Furthermore, we find a recursive expression of the Tutte polynomial and a recursive expression of the coboundary polynomial for this class of graphs. Finally we give a class of links associated with triangulated ladders and give some of their properties.
dc.identifierNtazinda, Alfred
dc.identifierSchool of Natural and Applied Sciences
dc.identifierhttps://dspace.unima.ac.mw/handle/123456789/317
dc.identifier.urihttps://edurepo.maren.ac.mw/handle/123456789/2238
dc.languageen
dc.subjectgraphs
dc.subjectlinks
dc.subjecttriangulating ladders
dc.subjectgraph polynomials
dc.subjectchromatic polynomial
dc.subjectTutte polynomial
dc.subjectcoboundary polynomial
dc.titleTriangulated ladders, polynomials and links.
dc.typetext::thesis::master thesis

Files

Collections

Theses