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 embeddingsIn a book embedding, a graph is embedded in a “book” of halfplanes joined along a “spine” (a line), so that the vertices are allembedded on the spine, and the edges in each page do notcross. A book embedding is minimal if it uses the smallestpossible number of pages.b 4b 3b 2Here is a book embedding forthe complete bipartite graphK 4,4 . It also realizes theminimal number of links inK 4,4 .b 1a 1a 2 a 3a 4Blake MellorIntrinsic Properties of Spatial Graphs
Introduction Linking and Knotting Other Intrinsic Properties ConclusionBook embeddingsMinimal book embeddings of graphs are good candidates forembeddings with the simplest possible knotting and linkingbehavior.Blake MellorIntrinsic Properties of Spatial Graphs
Page 1 and 2: Introduction Linking and Knotting O
Page 11: Introduction Linking and Knotting O

Intrinsic Properties of Spatial Graphs - Denison University

Create successful ePaper yourself

Delete template?

Save as template?