The 1-Yamabe equation on graph
classification
🧮 math.DG
math.AP
keywords
equationyamabedeltagraphmathrmabovealphaalpha-1
read the original abstract
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 $1$-Yamabe equation always has a nontrivial solution $u\geq0$, $u\neq0$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.