Related papers: Concordance of spatial graphs
In this paper we prove a compactness theorem for a sequence of harmonic maps which are defined on a converging sequence of Riemannian manifolds.
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval graphs. We study…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
In [D.A. Fedoseev, V.O. Manturov, A sliceness criterion for odd free knots,arXiv:1707.04923], the authors proved a sliceness criterion for odd free knots: free knots with odd chords. In the present paper we give a similar criterion for…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…
Consider a spherically symmetric spacelike slice through a spherically symmetric spacetime. One can derive a universal bound for the optical scalars on any such slice. The only requirement is that the matter sources satisfy the dominant…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
Given graphs $X$ and $Y$, we define two conic feasibility programs which we show have a solution over the completely positive cone if and only if there exists a homomorphism from $X$ to $Y$. By varying the cone, we obtain similar…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the…
We show that the difference between the topological 4-genus of a knot and the minimal genus of a surface bounded by that knot that can be decomposed into a smooth concordance followed by an algebraically simple locally flat surface can be…
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…
We prove a generalization of Gromov's conjecture on scalar curvature rigidity of convex polytopes to arbitrary convex Riemannian polytope type domains via harmonic spinors on convex domians with boundary condition constructed by Brendle. In…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…
The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total…
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra…
We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…
We give sufficient conditions on a labeled direct graph to determine whether the Tanaka prolongation of its associated Lie algebra is infinite-dimensional. In the case that all directed edges are labeled differently, the corresponding graph…