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 sum labeling of a graph G is a one-to-one function : V (G) → N ∪{0} that induces a bijection f *: E(G) →{𝑀1,𝑀2,…𝑀𝑞} of the edges of G defined by f * (uv) = f(u) + f(v), for all e = uv ε E(G). The graph which admits such labeling is called a centered triangular sum graph. In this article, the centered triangular sum labeling of union of some graphs are studied.
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.
Login if you have purchased
