N-Set Distance-Labelings for Cycle Graphs

Abstract

Let ( ) , G V E = be a graph and m C be the cycle graph with m vertices. In this paper, we continued Yeh's work [1] on the distance labeling of the cycle graph m C . An n-set distance labeling of a graph G is the labeling of the ver-Keywords