### The Study of Distance-Labelings for Cycle Graphs

Let G = (V,E) be a diagram and Cm be the cycle diagram with m top. In this chapter, we resumed Yeh’s work [1] on the distance labeling of the phase diagram Cm. An n-set distance labeling of a diagram G is the labeling of the top (with n labels per top) of G under…

Read more