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
