ABSTRACT
A centered triangular sum labeling of a graph G is a one-to-one function f : V (G) → N that induces a bijection f *: E(G) →{ } 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.
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.
Login if you have purchased
