Pathwidth and component number of links
A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for the degree of Master of Science, University of the Witwatersrand. November 2014. === Knot theory is a branch of algebraic topology that is concerned with studying the interesting geometrical structu...
Main Author: | |
---|---|
Format: | Others |
Language: | en |
Published: |
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/10539/17654 |
id |
ndltd-netd.ac.za-oai-union.ndltd.org-wits-oai-wiredspace.wits.ac.za-10539-17654 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-netd.ac.za-oai-union.ndltd.org-wits-oai-wiredspace.wits.ac.za-10539-176542019-05-11T03:41:19Z Pathwidth and component number of links Mdakane, Sizwe Knot theory. A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for the degree of Master of Science, University of the Witwatersrand. November 2014. Knot theory is a branch of algebraic topology that is concerned with studying the interesting geometrical structures known as knots. The idea of a knot in the theory of knots is entirely different from everyday’s idea of knots, that is, a knot has free ends. In knot theory a knot is defined as a knotted loop of string which does not have free ends unless we cut it using a pair of scissors. The interesting aspect of knot theory is that it enables us to transfer techniques from graph theory, algebra, topology, group theory and combinatorics to study different classes of knots. In this dissertation we are only concerned with the relationship between knot theory and graph theory. It is widely known in knot theory literature that a knot has a corresponding signed planar graph and that a signed planar graph also has a corresponding knot which depends on the signs of the edges of its signed planar graph. This provides a foundation of a solid relationship between knot theory and graph theory, and it allows for some of the notions in graph theory to be transferred to knot theory. In this dissertation we study the path width and component number of links through their corresponding graphs. 2015-05-07T06:38:51Z 2015-05-07T06:38:51Z 2015-05-07 Thesis http://hdl.handle.net/10539/17654 en application/pdf application/pdf application/pdf |
collection |
NDLTD |
language |
en |
format |
Others
|
sources |
NDLTD |
topic |
Knot theory. |
spellingShingle |
Knot theory. Mdakane, Sizwe Pathwidth and component number of links |
description |
A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for the degree of Master of Science, University of the Witwatersrand. November 2014. === Knot theory is a branch of algebraic topology that is concerned with studying the
interesting geometrical structures known as knots. The idea of a knot in the theory
of knots is entirely different from everyday’s idea of knots, that is, a knot has free
ends. In knot theory a knot is defined as a knotted loop of string which does not have
free ends unless we cut it using a pair of scissors.
The interesting aspect of knot theory is that it enables us to transfer techniques
from graph theory, algebra, topology, group theory and combinatorics to study different
classes of knots. In this dissertation we are only concerned with the relationship
between knot theory and graph theory.
It is widely known in knot theory literature that a knot has a corresponding signed
planar graph and that a signed planar graph also has a corresponding knot which depends
on the signs of the edges of its signed planar graph. This provides a foundation
of a solid relationship between knot theory and graph theory, and it allows for some
of the notions in graph theory to be transferred to knot theory. In this dissertation
we study the path width and component number of links through their corresponding
graphs. |
author |
Mdakane, Sizwe |
author_facet |
Mdakane, Sizwe |
author_sort |
Mdakane, Sizwe |
title |
Pathwidth and component number of links |
title_short |
Pathwidth and component number of links |
title_full |
Pathwidth and component number of links |
title_fullStr |
Pathwidth and component number of links |
title_full_unstemmed |
Pathwidth and component number of links |
title_sort |
pathwidth and component number of links |
publishDate |
2015 |
url |
http://hdl.handle.net/10539/17654 |
work_keys_str_mv |
AT mdakanesizwe pathwidthandcomponentnumberoflinks |
_version_ |
1719083483577450496 |