We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically sensitive elementary cellular automata and find that the overall number of complex patterns decreases under increasing neighborhood size in regular graphs. As exemplary applications, we apply the formalism to complex networks and compare the potential of scale-free graphs and metabolic networks to generate complex dynamics.Introduction-Cellular automata (CA) on graphs in principle provide the possibility to monitor systematic changes of dynamics under variation of network topology. In practice, however, unambiguously studying the relation between topology and dynamics with CA is conceptually difficult, since changes in topology inevitably induce changes in the rule space. Proposed by von Neumann [1] as a model system for biological selfreproduction, a surge of research activity from the 80's onwards [2] established them as the standard tool of complex systems theory and spatio-temporal pattern formation [3] on regular grids. Another discrete and binary modeling approach for complex biological systems are random Boolean networks (RBNs), introduced by Kauffman [4]. While the CA framework introduces one rule for all regularly ordered cells with bi-directional links, the original RBNs consist of randomly and directionally linked nodes with individual rules. Here, we present a formalism that generalizes CA to arbitrary architectures. It allows (i) the establishment of a general correspondence between CA and isotropic RBNs and (ii) the comparison of the potential of different topologies to generate complex dynamics. As applications we examine the topological sensitivity of elementary CA, monitor the number of complex rules of CA under increasing neighborhood size, and compare the dynamic potential of scale-free graphs and representations of metabolism as substrate graphs.