p-th Kazdan-Warner equation on graph

Abstract

Let $G=(V,E)$ be a connected finite graph and $C(V)$ be the set of functions defined on $V$. Let $\Delta_p$ be the discrete $p$-Laplacian on $G$ with $p>1$ and $L=\Delta_p-k$, where $k\in C(V)$ is positive everywhere. Consider the operator $L:C(V)\rightarrow C(V)$. We prove that $-L$ is one to one, onto and preserves order. So it implies that there exists a unique solution to the equation $Lu=f$ for any given $f\in C(V)$. We also prove that the equation $\Delta_pu=\overline{f}-f$ has a solution which is unique up to a constant, where $\overline{f}$ is the average of $f$. With the help of these results, we finally give various conditions such that the $p$-th Kazdan-Warner equation $\Delta_pu=c-he^u$ has a solution on $V$ for given $h\in C(V)$ and $c\in \mathds{R}$. Thus we generalize Grigor'yan, Lin and Yang's work \cite{GLY} for $p=2$ to any $p>1$.