Let [n]∗ denote the set of integers {−n−1 2 , . . . , n−1 2 } if n is odd, and {−n 2 , . . . , n 2 } \ {0} if n is even. A super edge-graceful labeling f of a graph G of order p and size q is a bijection f : E(G) → [q]∗, such that the induced vertex labeling f ∗ given by f ∗(u) = ∑ uv E(G) f(uv) is a bijection f ∗ : V (G) → [p]∗. A graph is super edge-graceful if it has a super edge-graceful la...

Let G be a graph with p vertices and q edges an injective function, where k is positive integer. If the induced edge labeling defined by for each bijection, then f called odd Fibonacci irregular of G. A which admits graph. The irregularity strength ofes(G) minimum labeling. In this paper, some subdivision graphs obtained from vertex identification determined.

For every h ∈ N, a graph G with the vertex set V (G) and the edge set E(G) is said to be h-magic if there exists a labeling l : E(G) → Zh\{0} such that the induced vertex labeling s : V (G) → Zh, defined by s(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is zero, we say that G admits a zero-sum h-magic labeling. The null set of a graph G, denoted by N(G), is the set of all natural ...

If the vertex set V of > =< V,E G can be divided into two un empty sets X and Y , ∅ = = Y V,X Y X ∩ ∪ , but also two nodes of every edge belong to X and Y separately, the G is called bipartite graph. If E ) ,y Y,(x X,y x i i i i ∈ ∈ ∈ ∀ then G is called complete bipartite graph. if n Y m, X = = , the G is marked m,n K . In this paper the graceful labeling, k-graceful labeling, odd graceful labe...