Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{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) = \Sigma$ $\{f(u,v): (u, v) \in E(G) \}$, is a one-to-one map. In this paper, we analyze the group-antimagic property for Cartesian products, hexagonal nets and theta graphs
For k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0}...
AbstractA graph is magic if the edges are labeled with distinct nonnegative real numbers such that t...
An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of in...
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 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 simple graph G = (V, E) is A-antimagic if there exists an ed...
Let Α be a non-trivial abelian group. A connected simple graph G = (V, E) is Α-antimagic if there ex...
AbstractAn anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a ...
AbstractAn antimagic labeling of a finite undirected simple graph with m edges and n vertices is a b...
Let A be a nontrivial abelian group and A* = A \ {0}. A graph is A-magic if there exists an edge lab...
Let A be a nontrivial additive abelian group and A* = A \ {0}. A graph is A-magic if there exists an...
Let A be a non-trivial Abelian group. We call a graph G = (V, E) A-magic if there exists a labeling ...
AbstractAn antimagic labeling of a graph with M edges and N vertices is a bijection from the set of ...
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}...
AbstractA graph is magic if the edges are labeled with distinct nonnegative real numbers such that t...
An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of in...
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 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 simple graph G = (V, E) is A-antimagic if there exists an ed...
Let Α be a non-trivial abelian group. A connected simple graph G = (V, E) is Α-antimagic if there ex...
AbstractAn anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a ...
AbstractAn antimagic labeling of a finite undirected simple graph with m edges and n vertices is a b...
Let A be a nontrivial abelian group and A* = A \ {0}. A graph is A-magic if there exists an edge lab...
Let A be a nontrivial additive abelian group and A* = A \ {0}. A graph is A-magic if there exists an...
Let A be a non-trivial Abelian group. We call a graph G = (V, E) A-magic if there exists a labeling ...
AbstractAn antimagic labeling of a graph with M edges and N vertices is a bijection from the set of ...
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}...
AbstractA graph is magic if the edges are labeled with distinct nonnegative real numbers such that t...
An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of in...