Knot Graphs

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/1679

Full metadata record

DC Field	Value	Language
dc.contributor.author	Noble, S D	-
dc.contributor.author	Welsh, D J A	-
dc.date.accessioned	2008-02-20T16:49:04Z	-
dc.date.available	2008-02-20T16:49:04Z	-
dc.date.issued	2000	-
dc.identifier.citation	Journal of Graph Theory Volume 34, Issue 1, Date: May 2000, Pages: 100-111	en
dc.identifier.issn	1097-0118	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/1679	-
dc.description.abstract	We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph which 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.	en
dc.format.extent	147779 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Wiley	en
dc.subject	Reidemeister moves	en
dc.subject	delta-wye graphs	en
dc.subject	bicycle space	en
dc.subject	Tutte polynomial	en
dc.title	Knot Graphs	en
dc.type	Preprint	en
dc.identifier.doi	https://doi.org/10.1002/(sici)1097-0118(200005)34:1<100::aid-jgt9>3.3.co;2-i	-
Appears in Collections:	Computer Science Mathematical Sciences

Files in This Item:

File	Description	Size	Format
FullText.pdf		144.32 kB	Adobe PDF	View/Open