Abstract : In this study we consider the sine-Gordon equation formulated on domains which are not locally homeomorphic to any subset of the Euclidean space. More precisely, we formulate the discrete dynamics on trees and graphs. Each edge is assumed to be a 1D uniform lattice with end points identified with graph vertices. A special treatment is needed at the junctions in order to couple 1D lattices into a global communicating network. Our approach is based on considering the local conservation properties. Some preliminary numerical results are shown on a simple graph containing four loops. These results show the performance of the scheme in non-trivial realistic conditions.