J. Pandimadevi

  • Citations Per Year
Learn More
An H-magic labeling in an H-decomposable graph G is a bijection f : V (G)∪E(G)→ {1, 2, . . . , p+ q} such that for every copy H in the decomposition, ∑ v∈V (H) f(v)+ ∑ e∈E(H) f(e) is constant. The function f is said to be H-E-super magic if f(E(G)) = {1, 2, . . . , q}. In this paper, we study some basic properties of m-factor-E-super magic labeling and we(More)
A total graceful labeling (TGL) of a (p, q) graph G is a bijection f from V (G) ∪ E(G) to the set {1, 2, 3, . . . , p+ q} so that f(uv) = |f(u)− f(v)| for all uv ∈ E(G). A TGL is called a super if f(E) = {1, 2, 3, . . . , q}. A graph that admits a TGL is called a total graceful graph (TGG) and a graph that admits a super total graceful labeling is called a(More)
  • 1