Add to ORKGFor k ≥ 2, a graph G is called Zk-antimagic if there exists a labeling of its edges f: E(G) → Zk-{0} such that the labels induced on the vertices given by the sums of the labels of the edges incident to each vertex are all distinct. For a given graph G, the integer antimagic spectrum is the set of all integers k for which G is Zk-antimagic. This project focuses on characterizing the integer antimagic spectrum for a class of graphs called closed helms. Our method consists of applying previous results on the existence of Zk-antimagic labelings of subgraphs of closed helms, and extending these labelings to include the remaining edges
A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all ...
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges t...
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edg...
A labeling of graph is an assignment of values to its edges, vertices, or both. A Zk-antimagic labe...
Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimag...
Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists...
An edge labeling of a graph G = (V,E) is a bijection from the set of edges to the set of integers {1...
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there ex...
An antimagic labeling of a graph G =(V,E) is a bijection from the set of edges $E$ to the set of int...
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
Research Doctorate - Doctor of Philosophy (PhD)The concept of labeling of graphs has attracted many ...
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 nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if ther...
An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of pos...
Graph labeling is a remarkable field having direct and indirect involvement in resolving numerous is...
A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all ...
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges t...
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edg...
A labeling of graph is an assignment of values to its edges, vertices, or both. A Zk-antimagic labe...
Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimag...
Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-antimagic if there exists...
An edge labeling of a graph G = (V,E) is a bijection from the set of edges to the set of integers {1...
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there ex...
An antimagic labeling of a graph G =(V,E) is a bijection from the set of edges $E$ to the set of int...
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
Research Doctorate - Doctor of Philosophy (PhD)The concept of labeling of graphs has attracted many ...
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 nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if ther...
An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of pos...
Graph labeling is a remarkable field having direct and indirect involvement in resolving numerous is...
A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all ...
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges t...
Let A be a nontrivial abelian group. A simple graph G = (V,E) is A-antimagic, if there exists an edg...