Related papers: A note on Liouville type equations on graphs

We present solutions to the classical Liouville equation for ergodic and completely integrable systems - systems that are known to attain equilibrium. Ergodic systems are known to thermal equilibrate with a Maxwell-Boltzmann distribution…

Suppose that $G=(V, E)$ be a locally finite and connected graph with symmetric weight and uniformly positive measure, where $V$ denotes the vertex set and $E$ denotes the edge set. We are concered with the following problem $$…

We prove a Liouville-type theorem for bounded stable solutions $v \in C^2(\R^n)$ of elliptic equations of the type (-\Delta)^s v= f(v)\qquad {in $\R^n$,} where $s \in (0,1)$ {and $f$ is any nonnegative function}. The operator $(-\Delta)^s$…

Let $G=(V,E)$ be a locally finite graph, $\Omega\subset V$ be a bounded domain, $\Delta$ be the usual graph Laplacian, and $\lambda_1(\Omega)$ be the first eigenvalue of $-\Delta$ with respect to Dirichlet boundary condition. Using the…

Let $G$ be a graph with $n$ vertices and $m$ edges. The energy $E$ of the graph $G$ is defined as the sum of the moduli of the adjacency eigenvalues $\lambda_{1} \geq \lambda_{2} \geq \ldots \geq \lambda_{n}$ of $G$: $$…

We propose the conjecture that the domination number $\gamma(G)$ of a $\Delta$-regular graph $G$ with $\Delta\geq 1$ is always at most its edge domination number $\gamma_e(G)$, which coincides with the domination number of its line graph.…

In this paper, we study the following logarithmic Schr\"{o}dinger equation \[ -\Delta u+\lambda a(x)u=u\log u^2\ \ \ \ \mbox{ in }V \] on a connected locally finite graph $G=(V,E)$, where $\Delta$ denotes the graph Laplacian, $\lambda > 0$…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Let $G=(V, E)$ be a finite weighted graph, and $\Omega\subseteq V$ be a domain such that $\Omega^\circ\neq\emptyset$. In this paper, we study the following initial boundary problem for the non-homogenous wave equation \begin{equation*}…

Let $\alpha'$ and $\mu_i$ denote the matching number of a non-empty simple graph $G$ with $n$ vertices and the $i$-th smallest eigenvalue of its Laplacian matrix, respectively. In this paper, we prove a tight lower bound $$\alpha' \ge…

We use maximum principle to prove the Liouville theorem of the equation $\Delta U + b\cdot \nabla U + h U^{\alpha} = 0, U \geq 0, 0 < \alpha < \frac{n + 2}{n - 2}$ on the complete Riemannian manifold with non-negative Ricci tensor, which…

The inverse spectral problems are studied for the Sturm-Liouville operator on the star-shaped graph and for the matrix Sturm-Liouville operator with the boundary condition in the general self-adjoint form. We obtain necessary and sufficient…

We give a new inequality between the energy of a graph and a weighted sum over the edges of the graph. Using this inequality we prove that $\mathcal{E}(G)\geq 2R(H)$, where $ \mathcal{E}(G)$ is the energy of a graph $G$ and $R(H)$ is the…

An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…

In this article, we prove that the least energy nodal solutions to Lane-Emden equation $-{\Delta}u = |u|^{p-2}u$ with zero Dirichlet boundary conditions on a square are odd with respect to one diagonal and even with respect to the other one…

Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$, $\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$, respectively. Recently, Caro, Davila and Pepper…

Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…

In this paper, we assume that $q>0$, $p>1$ and $s\in(0,1)$ , and consider the following nonlinear fractional p-Laplacian equations on finite graphs: \begin{equation*} \left\{ \begin{array}{lll} \partial_t u^q(x,t)+(-\Delta)_p^su=0,\\[15pt]…

The linear arboricity of a graph $G$, denoted by $\text{la}(G)$, is the minimum number of edge-disjoint linear forests (i.e. forests in which every connected component is a path) in $G$ whose union covers all the edges of $G$. A famous…

We study the Dirichlet problem of the following discrete infinity Laplace equation on unbounded subgraphs \begin{equation*} \Delta_{\infty}u(x):=\inf_{y\sim x}u(y)+\sup_{y\sim x}u(y)-2u(x)=f(x). \end{equation*} For the homogeneous case…