Let $\overrightarrow {G} $ be an oriented graph with the vertex set $ V (\overrightarrow {G}) $
and the arc set $ A (\overrightarrow {G}) $. Suppose that $ D\subseteq\{0, 1,\dots,\partial\} …

A distance antimagic graph is a graph G admitting a bijection f: V (G)→{1, 2,…,| V (G)|} such
that for two distinct vertices x and y, ω (x)≠ ω (y), where ω (x)=∑ y∈ N (x) f (y), for N (x) the …

Let Γ=(V Γ, E Γ) be a simple undirected graph with finite vertex set V Γ and edge set E Γ. A
total n-labeling α: V Γ∪ E Γ→{1, 2,…, n} is called a total edge irregular labeling on Γ if for …

For a distance set $ D $, an oriented graph $\overrightarrow {G} $ is $ D $-antimagic if there
exists a bijective vertex labeling such that the sum of all labels of $ D $-out-neighbors is …

Given an oriented graph $\overrightarrow {G} $ and $ D $ a distance set of $\overrightarrow
{G} $, $\overrightarrow {G} $ is $ D $-antimagic if there exists a bijective vertex labeling such …

For a simple graph G, a bijection f: V (G)→[1,| V (G)|] is called as a local inclusive distance
antimagic (LIDA) labeling of G if w (u)≠ w (v) for every two adjacent vertices u, v∈ V (G) with …

We initiate to study a D-irregular labeling, which generalizes both non-inclusive and
inclusive d-distance irregular labeling of graphs. Let G=(V (G), E (G)) be a graph, D a set of …

Let be a graph of order n. Let be a bijection. For any vertex, the neighbor sum is called the
weight of the vertex and is denoted by where N (v) is the open neighborhood of If for any two …