CENTERED TRIANGULAR GRACEFUL LABELING FOR SOME SPECIAL GRAPHS
A graph G=(V,E) is whispered to be Centered Triangular Graceful, if there survives an injective function f:V(G) {0,1,2,…,CT_(q-1)} where CT_(q-1) remains the (〖q-1)〗^th Centered Triangular number such that the induced mapping f^*:E(G) {CT_1,CT_2,…,CT_(q-1)} defined by f^* (uv)=|f(u) – f(v)| is an injection designed for all edges uv ∈ E(G). If f^* ( E(G)) is an sequence of distinct consecutive centered triangular numbers then the function f is known to be centered triangular graceful labeling and the graph G which concedes f is called a Centered Triangular Graceful Graph. Some special graphs which admit Centered Triangular Graceful Graph was discussed.
Centered Triangular Graceful Labeling, Centered Triangular Graceful Graph