Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(G)}f(uv)$, is injective. The integer-antimagic spectrum of a graph $G$ is the set IAM$(G) = \{k\;|\; G \textnormal{ is } \mathbb{Z}_k\textnormal{-antimagic}$ $\textnormal{and } k \geq 2\}$. In this paper, we determine the integer-antimagic spectra for cycles with a chord, paths with a chord, and wheels with a chord
An antimagic labeling of a graph G =(V,E) is a bijection from the set of edges $E$ to the set of int...
A labeling of graph is an assignment of values to its edges, vertices, or both. A Zk-antimagic labe...
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists...
Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if ther...
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there ex...
Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimag...
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edg...
For k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0}...
Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagi...
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . ....
Abstract. An edge labeling of a graph is a bijection from E(G) to the set {1,2, … , |E(G)|}. If for ...
An edge labeling of a graph G = (V,E) is a bijection from the set of edges to the set of integers {1...
For a graph G = (V ,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is cal...
AbstractAn antimagic labeling of a finite undirected simple graph with m edges and n vertices is a b...
An antimagic labeling of a graph G =(V,E) is a bijection from the set of edges $E$ to the set of int...
A labeling of graph is an assignment of values to its edges, vertices, or both. A Zk-antimagic labe...
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists...
Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if ther...
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there ex...
Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimag...
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edg...
For k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0}...
Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagi...
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . ....
Abstract. An edge labeling of a graph is a bijection from E(G) to the set {1,2, … , |E(G)|}. If for ...
An edge labeling of a graph G = (V,E) is a bijection from the set of edges to the set of integers {1...
For a graph G = (V ,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is cal...
AbstractAn antimagic labeling of a finite undirected simple graph with m edges and n vertices is a b...
An antimagic labeling of a graph G =(V,E) is a bijection from the set of edges $E$ to the set of int...
A labeling of graph is an assignment of values to its edges, vertices, or both. A Zk-antimagic labe...
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...