An adjacent edge graceful labeling of pentagonal snake graph
Citation
Nivetha, G. N., Raj, T. T. & Gowri, A. (2026). An adjacent edge graceful labeling of pentagonal snake graph. TWMS Journal of Applied and Engineering Mathematics, 16(8), 1006-1017.Abstract
Let G be a graph with p vertices and q edges. The graph G is said to be an adjacent edge graceful graph if there exists bijection mapping f : E(G) → {1, 2, 3, ..., q} such that the induced vertex mapping f*: V (G) → N, where N is a natural number by f*(r) = Σk f(ek) taken over all edges ek incident to adjacent vertices of r is an injection. In this article we will go to prove the Pentagonal snake, Alternative Pentagonal Snake, Double Pentagonal snake and Alternative Double Pentagonal Snake are Adjacent Edge Graceful graph.
Volume
16Issue
8URI
https://jaem.isikun.edu.tr/web/index.php/current/146-vol16no8/1629https://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/7349
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
On the injective chromatic number of splitting graph and shadow graph of certain regular and biregular graphs
C. K., Bhanupriya; M. S., Sunitha (Işık University Press, 2025-01)The injective chromatic number of a graph G, denoted by χi(G) is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. The splitting graph ... -
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
PMC-labeling of prism allied graph, pendulum graph and cog wheel graph
Ponraj, R.; Prabhu, S. (Işık University Press, 2025-11-01)In this paper, we investigate the PMC-labeling behavior of some graphs like pendulum graph, hexagonal circular ladder, cog wheel graph, triangular wheel graph, double crown-wheel graph, crown-triangular wheel graph, Hn,n, ...




