Abstract
Abstract
The graceful labeling of a graph G with p vertices and q edges is an injection f: V (G) to {0, 1, 2… q} such that, when each edge uv is assigned the label |f (u)-f (v)|. The resulting edge set are {1, 2, 3 …q}. When graceful Labeling is applied to a graph it is known as a Gracful graph. In this paper, we introduce the graph HSn by arranging a series of Hexagons glued to each other by attaching the any one vertex of the first hexagon to the next one and the second hexagon to the third one and so on which is called a Hexagonal Snake. Thus, ‘n’ number of of hexagonal snakes are fixed along a path. We have applied graceful labeling to this Hexagonal Snake graph and have shown that it satisfies α-labeling.
Subject
General Physics and Astronomy
Reference6 articles.
1. A Dynamic survey of Graph labeling;Gallian;The Electronic Journal of Combinatorics,2015
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Designing of certain graphs by applying Unisum labeling;PROBLEMS IN THE TEXTILE AND LIGHT INDUSTRY IN THE CONTEXT OF INTEGRATION OF SCIENCE AND INDUSTRY AND WAYS TO SOLVE THEM: (PTLICISIWS-2022);2023
2. Graceful Labeling of Hexagonal and Octagonal Snakes Along a Path;Advances in Intelligent Systems and Computing;2022-09-30
3. Effect of surface line/regular hexagonal texture on tribological performance of cemented carbide tool for machining Ti-6Al-4V alloys;The International Journal of Advanced Manufacturing Technology;2021-07-17