Entanglement of Embedded Graphs

被引：8

作者：

Castle, Toen ^{[1
]}

Evans, Myfanwy E. ^{[1
]}

Hyde, Stephen T. ^{[1
]}

机构：

[1] Australian Natl Univ, Res Sch Phys, Dept Appl Math, Canberra, ACT 0200, Australia

来源：

PROGRESS OF THEORETICAL PHYSICS SUPPLEMENT | 2011年 / 191期

关键词：

CRYSTAL NETS; POLYHEDRA; KNOTS; LINKS;

D O I：

10.1143/PTPS.191.235

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

We discuss the identification of untangled graph embeddings for finite planar and nonplanar graphs as well as infinite crystallographic nets. Two parallel approaches are discussed: explicit 3-space ernbeddings and reticulations of 2-manifolds. 2D and 3D energies are proposed that allow ranking of (un)tangled embedding graphs.

引用

页码：235 / 244

页数：10