Categorical aspects of inducing closure operators on graphs by sets of walks

Abstract

We study closure operators on graphs which are induced by sets of walks of identical lengths in these graphs. It is shown that the induction gives rise to a Galois correspondence between the category of closure spaces and that of graphs with walk sets. We study the two isomorphic subcategories resulting from the correspondence, in particular, the one that is a full subcategory of the category of graphs with walk sets. As examples, we discuss closure operators that are induced by path sets on some natural graphs on the digital plane Z2. These closure operators are shown to include the well known Marcus–Wyse and Khalimsky topologies, thus indicating the possibility of using them as convenient background structures on the digital plane for the study of geometric and topological properties of digital images.