AN ADJACENT EDGE GRACEFUL LABELING OF PENTAGONAL SNAKE GRAPH

AN ADJACENT EDGE GRACEFUL LABELING OF PENTAGONAL SNAKE GRAPH

G. N. Nivetha, T. Tharma Raj, A. Gowri

[PDF]

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) ! f1; 2; 3; :::; qg such that the induced vertex mapping f : V (G) ! N, where N is a natural number by f(r) = P 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.

Keywords

Graph labeling, Adjacent edge graceful graphs, Pentagonal snake graphs, Alternative Pentagonal snake graphs