相关论文: Sinh-Gordon equations on finite graphs
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…
The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…
Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…
The possible boundary conditions consistent with the integrability of the classical sine-Gordon equation are studied. A boundary value problem on the half-line $x\leq 0$ with local boundary condition at the origin is considered. The most…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
The sine-Gordon equation is a nonlinear partial differential equation. It is known that the sine-Gordon has soliton solutions in the 1D and 2D cases, but such solutions are not known to exist in the 3D case. Several numerical solutions to…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
We consider PT-symmetric, nonlocal nonlinear Schrodinger equation on metric graphs. Vertex boundary conditions are derived from the conservation laws. Soliton solutions are obtained for simplest graph topologies, such as star and tree…
Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…
We initiate the study of the $p$-local commensurability graph of a group, where $p$ is a prime. This graph has vertices consisting of all finite-index subgroups of a group, where an edge is drawn between $A$ and $B$ if $[A : A\cap B]$ and…
A sequence $S$ of vertices of a graph $G$ is called a dominating sequence of $G$ if $(i)$ each vertex $v$ of $S$ dominates a vertex of $G$ that was not dominated by any of the vertices preceding vertex $v$ in $S$, and $(ii)$ every vertex of…
The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…
We study the following $1$-Yamabe equation on a connected finite graph $$\Delta_1u+g\mathrm{Sgn}(u)=h|u|^{\alpha-1}\mathrm{Sgn}(u),$$ where $\Delta_1$ is the discrete $1$-Laplacian, $\alpha>1$ and $g, h>0$ are known. We show that the above…
This thesis focuses on theoretical and algorithmic tools for determining the numbers of induced subgraphs in strongly regular graphs, SRGs, and on further applications of such numbers. We consider in more detail a restricted class of these…
This is a preliminary study of the equation of motion of Euclidean classical gravity on a graph, based on the Lin-Lu-Yau Ricci curvature on graphs. We observe that the constant edge weights configuration gives the unique solution on an…
We introduce pathographs as a framework to study graph classes defined by forbidden structures, including forbidding induced subgraphs, minors, etc. Pathographs approximately generalize s-graphs of L\'ev\^eque--Lin--Maffray--Trotignon by…
The sine-Gordon model on the half-line with a dynamical boundary introduced by Delius and one of the authors is considered at quantum level. Classical boundary conditions associated with classical integrability are shown to be preserved at…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…