Annals of Communications in Mathematics

AbstractHere, we define a cube sum labeling and cube sum graph. Let G be a (p, q) graph. G is said to be a cube sum graph if there exist a bijection f : V (G) → {0, 1, . . . , p − 1} such that the induced function f ∗ : E(G) → N given by are all distinct. In this paper, we developed the concept of cube sum labeling of some family of graphs like paths, cycle, stars, wheel graph, fan graphs are discussed in this paper.

AbstractHere, we define a cube sum labeling and cube sum graph. Let G be a (p, q) graph. G is said to be a cube sum graph if there exist a bijection f : V (G) → {0, 1, . . . , p − 1} such that the induced function f ∗ : E(G) → N given by are all distinct. In this paper, we developed the concept of cube sum labeling of some family of graphs like paths, cycle, stars, wheel graph, fan graphs are discussed in this paper.