arXiv research

Proves minimal crossing diagrams for specific spatial graphs.

New invariants distinguish spatial graphs not previously possible.

Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.

Grid homology theory for spatial graphs extends skein sequence.

Defines concordance for spatial graphs and proves sliceness equivalence.

New method reduces spatial graphs while preserving their topological features.

Algorithm determines spatial graph isomorphism with vertex, edge colorings and orientations.

New results on splitting tangles and spatial graphs.

Spatial graphs study tangle replacement with equivalence classes.

Spatial graphs are decomposed into planar forests and braids.

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exis…

The paper classifies palettes of Dehn colorings for spatial graphs.

We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a graph grid diagram. We prove that two graph grid diagrams representing the same tr…

Study on spatial graphs and their constituent knots, linking polynomial invariants.

Extends knot concordance invariant to balanced spatial graphs using grid homology.

This article presents a survey of some recent results in the theory of spatial graphs. In particular, we highlight results related to intrinsic knotting and linking and results about symmetries of spatial graphs. In both cases we consider spatial graphs in $S^3$ as well as in other $3$-manifolds.

We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of Yamada polynomials of some series of spatial graphs are dense in a certain region in …

New formulas for spatial 2-bouquet graphs discovered.

Classifies spatial graphs with finite N-quandles.

We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy do…

Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.

Complete classification of links and spatial graphs with finite N-quandles.

Paper generalizes pretzel links using spatial graphs.

For leveled spatial graphs, we find a surface embedding that allows cellular embedding.

A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in this paper. This enable us to show that certain classes of knots can yield hyperb…

The paper introduces a test to distinguish spatial graphs based on their knot diagrams.

Classical knot theory can be generalized to virtual knot theory and spatial graph theory. In 2007, Fleming and Mellor combined virtual knot theory and spatial graph theory to form, combinatorially, virtual spatial graph theory. In this paper, we introduce a topological definition of virtual spatial graphs that is simil…

The paper studies grid homology for spatial graphs and proves a Künneth formula for connected sums.

This is a short review article on invariants of spatial graphs, written for "A Concise Encyclopedia of Knot Theory" (ed. Adams et. al.). The emphasis is on combinatorial and polynomial invariants of spatial graphs, including the Alexander polynomial, the fundamental quandle of a graph, and the Yamada polynomial.

In this paper, we compute the graph skein algebra of the punctured disk with two holes. Then, we apply the graph skein techniques developed here to establish necessary conditions for a spatial graph to have a symmetry of order $p$, where $p$ is a prime. The obstruction criteria introduced here extend some results obtai…

Link homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component homotopy, which reduces to link homotopy in the classical case. Unlike previous attempts at generalizing link homotopy to spatial…

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We…

In this paper, we develop a novel Backtrackless Aligned-Spatial Graph Convolutional Network (BASGCN) model to learn effective features for graph classification. Our idea is to transform arbitrary-sized graphs into fixed-sized backtrackless aligned grid structures and define a new spatial graph convolution operation ass…

Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. We introduce some edge (resp. vertex)-homotopy invariants of spatial graphs by applying the Sato-Levine invariant for the 2-component constituent algebraically split links and show examples…

We survey the construction and properties of the Yamada polynomial of spatial graphs and present the Yamada polynomial formulae for some classes of graphs. Then we construct an infinite family of spatial graphs for which roots of Yamada polynomials are dense in the complex plane.

New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.

In this paper we construct some invariants of spatial graphs by disk-summing the constituent knots and show the delta edge-homotopy invariance of them. As an application, we show that there exist infinitely many slice spatial embeddings of a planar graph up to delta edge-homotopy, and there exist infinitely many bounda…

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet spatial graphs based on the number of precrossings and the placement of the precros…

Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.

First, we extend Otal's result for the trivial knot to trivial spatial graphs, namely, we show that for any bridge tangle decomposing sphere $S^2$ for a trivial spatial graph $Γ$, there exists a 2-sphere $F$ such that $F$ contains $Γ$ and $F$ intersects $S^2$ in a single loop. Next, we introduce two invariants for spat…

The understanding of geographical reality is a process of data representation and pattern discovery. Former studies mainly adopted continuous-field models to represent spatial variables and to investigate the underlying spatial continuity/heterogeneity in the regular spatial domain. In this article, we introduce a more…

Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. Fleming and the author introduced some edge (resp. vertex)-homotopy invariants of spatial graphs by applying the Sato-Levine invariant for the constituent 2-component algebraically split li…

Classifies colored links and spatial graphs up to colored link-homotopy.

The paper generalizes linking number properties for complete graphs.

This study proposes a graph partitioning method to improve spatial prediction models.

Proposes a method to forecast spatial-temporal data with limited training data.

We define the fundamental quandle of a spatial graph and several invariants derived from it. In the category of graph tangles, we define an invariant based on the walks in the graph and cocycles from nonabelian quandle cohomology.

Introduces Spectral Graph Network combining spatial and spectral message passing.