ABSTRACT
Let G be a graph with p vertices and q edges. The nth centered triangular number is denoted by πΆπ, where πΆπ = 1/2 (3n2 – 3n + 2). A centered triangular graceful labeling of a graph G is a one-to-one function π : V (G) β {0,1,β¦πΆπ} that induces a bijection f *: E(G) β{πΆ1,πΆ2,β¦πΆπ} of the edges of G defined by f * (e) = βf(u) – f(v)β, for all e = uv Ξ΅ E(G). The graph which admits such labeling is called a centered triangular graceful graph.
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.
Login if you have purchased
