𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Knots and graphs in chemistry

✍ Scribed by Erica Flapan


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
950 KB
Volume
9
Category
Article
ISSN
0960-0779

No coin nor oath required. For personal study only.

✦ Synopsis


This paper presents a knot theoretic approach to the study of molecular graphs. It provides examples of molecular knots and links as well as other topologically complex molecules. The paper discusses various topological problems and theorems which were motivated by questions in chemistry. Some of these results have direct applications to the analysis of molecular structures, while other results, though arising out of questions about chemistry, are purely topological in nature.


πŸ“œ SIMILAR VOLUMES


Knots and links in spatial graphs
✍ J. H. Conway; C. McA. Gordon πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 328 KB

## Abstract The main purpose of this paper is to show that any embedding of __K~7~__ in three‐dimensional euclidean space contains a knotted cycle. By a similar but simpler argument, it is also shown that any embedding of __K~6~__ contains a pair of disjoint cycles which are homologically linked.

Knots and Links in Certain Spatial Compl
✍ Takashi Otsuki πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 311 KB

We give a spatial representation of the complete graph K n which contains exactly ( n 6 ) Hopf links consisting of pairs of disjoint 3-cycles, where ( n 6 ) is the minimum number of pairs of disjoint 3-cycles forming a non-split link contained in any spatial representation of K n . Furthermore, we s

Dual graphs and knot invariants
✍ Magnhild Lien; William Watkins πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 159 KB
Realization of knots and links in a spat
✍ Kouki Taniyama; Akira Yasuhara πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 373 KB

For a graph G, let Ξ“ be either the set Ξ“ 1 of cycles of G or the set Ξ“ 2 of pairs of disjoint cycles of G. Suppose that for each Ξ³ ∈ Ξ“ , an embedding In this paper, we have the following three results: (1) For the complete graph K 5 on 5 vertices and the complete bipartite graph K 3,3 on 3 + 3 ver