Sinh-Gordon equations on finite graphs

Abstract

In this paper, we focus on the sinh-Gordon equation 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.