𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


From Graphs to Spatial Graphs
✍ Dale, M.R.T.; Fortin, M.-J. πŸ“‚ Article πŸ“… 2010 πŸ› Annual Reviews 🌐 English βš– 562 KB
The rotation graphs of perfect matchings
✍ Heping Zhang; Fuji Zhang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 517 KB

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

On the rotation distance of graphs
✍ R.J. Faudree; R.H. Schelp; L. Lesniak; A. GyΓ‘rfΓ‘s; J. Lehel πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 972 KB

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

Rotational circulant graphs
✍ Thomson, Alison; Zhou, Sanming πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 425 KB
An invariant of spatial graphs
✍ ShΗ”ji Yamada πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 464 KB

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.