“…A digital space G is a simple undirected graph G=(V, W) where V=(v 1 , v 2 , ... v n , …) is a finite or countable set of points, and W = ((v р v q ),....) is a set of edges. Topological properties of G as a digital space in terms of adjacency, connectedness and dimensionality are completely defined by set W. Let G and v be a graph and a point of G. In ( [13], [14] For two graphs G=(X, U) and H=(Y, W) with disjoint point sets X and Y, their join G⊕H is the graph that contains G, H and edges joining every point in G with every point in H.…”