<p>In this paper, we focus on the sinh-Gordon equations on graphs. We introduce a uniform a priori estimate to define the topological degree for this equation with nonzero prescribed functions on finite, connected, and symmetric graphs. Furthermore, we calculate this topological degree case by case and show several existence results. In particular, we prove that the classical sinh-Gordon equation with nonzero prescribed function is always solvable on such graphs.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Sinh-Gordon equations on finite graphs

  • Linlin Sun

摘要

In this paper, we focus on the sinh-Gordon equations on graphs. We introduce a uniform a priori estimate to define the topological degree for this equation with nonzero prescribed functions on finite, connected, and symmetric graphs. Furthermore, we calculate this topological degree case by case and show several existence results. In particular, we prove that the classical sinh-Gordon equation with nonzero prescribed function is always solvable on such graphs.