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 certain restraints determined by the distance ‘tween each pair of vertices in G. Following Yeh’s documentation [1], the smallest advantage for the best label in an n-set distance labeling of G is meant by A1(n) (G)…..

Author(s) Details:

Alissa Shen,
St. Stephen’s Episcopal School, Austin, Texas, USA.

Jian Shen,
Department of Mathematics, Texas State University, San Marcos, Texas, USA.

Please see the link here: https://stm.bookpi.org/RHMCS-V9/article/view/10445

Keywords: Graph, graph theory, channel assignment, distance labeling, cycle graph, neuroscience, neuronal pathway