We use combinatorial knot theory to construct invariants for spatial graphs. This is done by performing certain replacements at each vertex of a spatial graph diagram D , which results in a collection of knot and link diagrams in D. By applying known invariants for classical knots and links to the resulting collection, we obtain invariants for spatial graphs. We also show that for the case of undirected spatial graphs, the invariants we construct here satisfy a certain contraction-deletion recurrence relation.
Aceves, Elaina and Elder, Jennifer
"On Invariants for Spatial Graphs,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 16:
2, Article 1.
Available at: https://scholar.rose-hulman.edu/rhumj/vol16/iss2/1