Let A be a non-trivial abelian group. A 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 and } k \geq 2\}. In this paper, we determine the integer-antimagic spectra of disjoint unions of cycles
An antimagic labeling of a graph G(V,E) is a bijection f mapping from E to the set {1,2,…, |E|}, so ...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
Abstract. An edge labeling of a graph is a bijection from E(G) to the set {1,2, … , |E(G)|}. If for ...
Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists...
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edg...
Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if ther...
Let Α be a non-trivial abelian group. A connected simple graph G = (V, E) is Α-antimagic if there ex...
Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagi...
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there ex...
Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E(G)$ to $\{1,2, \dots, m\}$. For...
For k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0}...
An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of in...
AbstractAn anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a ...
AbstractAn antimagic labelling of a finite undirected simple graph with m edges and n vertices is a ...
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 f mapping from E to the set {1,2,…, |E|}, so ...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
Abstract. An edge labeling of a graph is a bijection from E(G) to the set {1,2, … , |E(G)|}. If for ...
Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists...
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edg...
Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if ther...
Let Α be a non-trivial abelian group. A connected simple graph G = (V, E) is Α-antimagic if there ex...
Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagi...
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there ex...
Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E(G)$ to $\{1,2, \dots, m\}$. For...
For k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0}...
An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of in...
AbstractAn anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a ...
AbstractAn antimagic labelling of a finite undirected simple graph with m edges and n vertices is a ...
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 f mapping from E to the set {1,2,…, |E|}, so ...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
Abstract. An edge labeling of a graph is a bijection from E(G) to the set {1,2, … , |E(G)|}. If for ...