Add to ORKGAn antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2,...,m} such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling. We prove this conjecture for regular graphs of odd degree.
An edge labeling of a graph G = (V,E) is a bijection from the set of edges to the set of integers {1...
Let G = (V,E) be a finite, simple and undirected graph with p vertices and q edges. An (a, d)-vertex...
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges t...
[[abstract]]A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,....
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
126 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.A labeling of a graph is a bi...
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . ....
An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E ...
An antimagic labeling of a graph G is a bijection f:E(G)→{1,…,|E(G)|} such that the weights w(x)=∑y∼...
An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective ma...
Research Doctorate - Doctor of Philosophy (PhD)The concept of labeling of graphs has attracted many ...
Hartsfeld and Ringel in 1990 introduced the concept of an antimagic labeling of a graph, that is, a ...
An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and...
In 1990, Hartsfield and Ringel conjectured “Every tree except K2 is antimagic”, where antimagic mean...
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...
Let G = (V,E) be a finite, simple and undirected graph with p vertices and q edges. An (a, d)-vertex...
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges t...
[[abstract]]A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,....
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
126 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.A labeling of a graph is a bi...
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . ....
An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E ...
An antimagic labeling of a graph G is a bijection f:E(G)→{1,…,|E(G)|} such that the weights w(x)=∑y∼...
An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective ma...
Research Doctorate - Doctor of Philosophy (PhD)The concept of labeling of graphs has attracted many ...
Hartsfeld and Ringel in 1990 introduced the concept of an antimagic labeling of a graph, that is, a ...
An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and...
In 1990, Hartsfield and Ringel conjectured “Every tree except K2 is antimagic”, where antimagic mean...
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...
Let G = (V,E) be a finite, simple and undirected graph with p vertices and q edges. An (a, d)-vertex...
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges t...