Intrinsic Properties of Spatial Graphs - Denison University

More documents

Recommendations

Info

$Math 232 syllabus - Denison University$

$Math 102 syllabus - Personal Pages - Denison University$

Introduction Linking and Knotting Other Intrinsic Properties ConclusionBook embeddingsMinimal book embeddings of graphs are good candidates forembeddings with the simplest possible knotting and linkingbehavior.Otsuki (1996) defined a canonical book representation of acomplete graph K n , and showed that it minimized the number ofpairs of linked 3-cycles and the number of knotted 7-cycles.Fleming and M (2009) showed it also minimized the number oflinks of a 3-cycle and a 4-cycle.Blake MellorIntrinsic Properties of Spatial Graphs
Introduction Linking and Knotting Other Intrinsic Properties ConclusionBook embeddingsMost recently, Politano* and Rowland (2011) counted andclassified all the knots in the canonical book embeddings of K nfor n ≤ 11.graph K 7 K 8 K 9 K 10 K 11# knots 1 29 577 9991 165,102Blake MellorIntrinsic Properties of Spatial Graphs
Page 1 and 2: Introduction Linking and Knotting O
Page 13: Introduction Linking and Knotting O

Intrinsic Properties of Spatial Graphs - Denison University

Create successful ePaper yourself

Delete template?

Save as template?