Related papers: Sinh-Gordon equations on finite graphs

We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…

We consider a parabolic sine-Gordon model with periodic boundary conditions. We prove a fundamental maximum principle which gives a priori uniform control of the solution. In the one-dimensional case we classify all bounded steady states…

We study constant mean curvature surfaces in the three-dimensional Heisenberg group. We prove that a constant mean curvature surface in a neighborhood of non-umbilic point is described by some solution of a sinh-Gordon equation subject to a…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…

We show that for every fixed undirected graph $H$, there is a $O(|V(G)|^3)$ time algorithm that tests, given a graph $G$, if $G$ contains $H$ as a topological subgraph (that is, a subdivision of $H$ is subgraph of $G$). This shows that…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…

We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

In this paper, we introduce the so-called multiscale limit for spectral curves, associated with real finite-gap Sine-Gordon solutions. This technique allows to solve the old problem of calculating the density of topological charge for real…

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…

In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…

An equation is called graph-regular if it always has monochromatic solutions under edge-colorings of the complete graph on the naturals. We present two Rado-like conditions which are respectively necessary and sufficient for an equation to…

Let $G=(V,E)$ be a connected finite graph. We study the relativistic non-Abelian Chern-Simons-Higgs vortex equations on the graph $G$. We establish an existence result to the relativistic non-Abelian Chern-Simons-Higgs vortex equations.

Ultradiscretization with negative values is a long-standing problem and several attempts have been made to solve it. Among others, we focus on the symmetrized max-plus algebra, with which we ultradiscretize the discrete sine-Gordon…

We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…

In the present paper we initiate the variational analysis of a super sinh-Gordon system on compact surfaces, yielding the first example of non-trivial solution of min-max type. The proof is based on a linking argument jointly with a…

Let $G=(V, E)$ be a finite connected graph, where $V$ denotes the set of vertices and $E$ denotes the set of edges. We revisit the following Chern-Simons Higgs model, \begin{equation*} \Delta u=\lambda…