Spatial-graph isotopy for trivalent graphs and minimally knotted embeddings

In this paper, we study spatial-graph isotopy for trivalent graphs, and give a connection between this equivalence relation and minimally knotted embeddings of graphs into 3-space. It will be seen that a rearrangement theorem (Theorem 2) plays an important role in investigating mutually isotopic embeddings of a trivalent graph.