Shifted-antimagic labelings for graphs (Q2045398)

An antimagic labeling of a finite simple undirected graph with $q$ edges is a bijection from the set of edges to the set of integers $\{1, 2 , \dots, q\}$ such that the vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of labels of all edges incident to such a vertex and this concept is well studied in the literature. This paper studies a weak version called $k$-shifted-antimagic labeling which allows the consecutive numbers starting from $k+1$, instead of $1$, where $k$ is any positive integer. This paper establishes connections among various concepts proposed in the literature on antimagic labelings. Let $G=(V,E)$ be a graph with $|E(G)| = m$. For a given positive integer $k$ if there exists an injective function $f$ from $E(G)$ to $\{k+1, k+2, \dots, k+m\}$ such that the vertex sums $s(v)$ for all the vertices $v$ of $G$ are distinct then we say that $G$ admits $k$-shifted-antimagic labeling. If $G$ admits such a labeling then $G$ is called the $k$-shifted-antimagic graph. In this paper, the authors analyse the values of $k$ for a given graph $G$ such that $G$ is $k$-shifted-antimagic graph. The study on disconnected graphs for being antimagic or not has received very little attention in the literature. The authors of this paper show some classes of disconnected graphs which are $k$-shifted-antimagic or not $k$-shifted-antimagic for some values of $k$. In this paper, the disconnected graph $G$ having three component, say $G_1$, $G_2$ and $G_3$ is denoted by $G := G_1+G_2+G_3$ and ``+'' is taken as the disjoint union of graphs. This paper opens a new study in the field of graph labeling.