Rotation of spatial graphs
β Scribed by Teruhiko Soma; Hideyuki Sugai
- Book ID
- 104188215
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 904 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0166-8641
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for generalized polyhex graphs to arbitrary plane
Let (x,y) be an edge of a graph G. Then the rotation of (x, y) about x is the operation of removing (x, y) from G and inserting (x, y') as an edge, where y' is a vertex of G. The rotation distance between graphs G and H is the minimum number of rotations necessary to transform G into H. Lower and up
G n B, C P,, then we say that G is aflat vertex graph. For two spatial graphs G and G', if there exists an isotopy h,:R3 + R3 t E [0,1] such that h, = id \*Dedicated to Professor Fujitsugu Hosokawa on his sixtieth birthday.