Knot graphs

Noble, Steven and Welsh, D.J.A. (2000) Knot graphs. Journal of Graph Theory 34 (1), pp. 100-111. ISSN 0364-9024.

Full text not available from this repository.

Official URL: https://doi.org/10.1002/(SICI)1097-0118(200005)34:...

Abstract

We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph that is reducible by some finite sequence of these moves, to a graph with no edges, is called a knot graph. We show that the class of knot graphs strictly contains the set of delta‐wye graphs. We prove that the dimension of the intersection of the cycle and cocycle spaces is an effective numerical invariant of these classes.

Metadata

Item Type:	Article
Additional Information:	https://bura.brunel.ac.uk/bitstream/2438/1679/1/knots.pdf
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	20 Jul 2020 13:32
Last Modified:	09 Aug 2023 12:48
URI:	https://eprints.bbk.ac.uk/id/eprint/32607

Statistics

Archive Staff Only (login required)