VERTEX GRACEFUL AND DIFFERENCE LABELING OF SOME SPECIAL GRAPHS

Abstract

In this expose for any graph G having vertices V and edges E . A Graph with vertex V and edge E is said to have difference labeling of G ,if for an injection f from V to the set of non-negative integer together with weight function f ∗ on E given by f ∗ (uv) = |f(u) − f(v)| for every edge uv ∈ E . A graph with a difference labeling on it is called a labeled graph. Also a graph with distinct vertex labeled graph is called vertex graceful labeling. This theory provides a viewpoint that helps provide new insights in the discovery of Vertex graceful and Difference labeling on gear graph Gn , swasthick graph Sn , coconut tree graph CTn , Q tree, Y tree