ON THE SIMPLICIAL COMPLEX STEMMED FROM A DIGITAL GRAPH

Abstract

In this paper, we give a digital graph-theoretical ap- proach of the study of digital images with relation to a simpli- cial complex. Thus, a digital graph Gk with some k-adjacency in Z n can be recognized by the simplicial complex spanned by Gk. Moreover, we demonstrate that a graphically (k0;k1)-continuous map f : Gk0 Z n 0 ! Gk1 Z n 1 can be converted into the