Affiliation:
1. Institute of Mathematics, Brno University of Technology , 616 69 Brno , Czech Republic
Abstract
Abstract
After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line
Z
{\mathbb{Z}}
with a certain set of paths of length
n
n
for every positive integer
n
n
. The connectedness in the strong product of three copies of the graph is used to define digital Jordan surfaces. These are obtained as polyhedral surfaces bounding the polyhedra that can be face-to-face tiled with digital tetrahedra.