Closure operators on graphs for modeling connectedness in digital spaces

Abstract

For undirected simple graphs, we introduce closure operators on their vertex sets induced by sets of walks of the same lengths. Some basic properties of these closure operators are studied, with greater attention paid to connectedness. We focus on the closure operators induced by certain sets of walks in the 2-adjacency graph on the digital line Z, which generalize the Khalimsky topology. For the closure operators on Z^2 obtained as particularly defined products of pairs of the induced closure operators on Z, we formulate and prove a digital form of the Jordan curve theorem.