On k-super graceful labeling of graphs

Abstract: Let

G = (V (G), E (G))

be a simple, finite and undirected graph of order

p

and size

q

. For

k g e 1

, a bijection

f : V (G) c u p E (G) o k, k + 1, k + 2, l d o t s, k + p + q - 1

such that

f (u v) = | f (u) - f (v) |

for every edge

u v i n E (G)

is said to be a

k

-super graceful labeling of

G

. We say

G

is

k

-super graceful if it admits a

k

-super graceful labeling. In this paper, we study the

k

-super gracefulness of some standard graphs. Some general properties are obtained. Particularly, we found many sufficient conditions on

k

-super gracefulness for many families of (complete) bipartite and tripartite graphs. We show that some of the conditions are also necessary.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: On \(k\)-super graceful labeling of graphs