- Full text PDF available (0)

Learn More

- S. P. Subbiah, J. Pandimadevi, R. Chithra
- Electronic Notes in Discrete Mathematics
- 2015

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
- ›