I will talk about the sinh-Gordon equation on graphs. We define the topological degree by state a uniform a priori estimate for sinh-Gordon equations on a finite and connected graph. We also compute topological degree and give some existence results for sinh-Gordon equations. In particular, the classical sinh-Gordan equation on a finite and connected graph is always solvable.