Add to ORKGAn undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E → {1,…|E|} such that (formula presented) for any pair of different nodes u, v ∈ V. In this note we prove - with a slight modification of an argument of Cranston et al. - that k-regular graphs are antimagic for k ≥ 2. © 2015, Australian National University. All rights reserved
An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective ma...
126 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.A labeling of a graph is a bi...
An antimagic labelling of a graph G is a bijection f : E ( G ) →{ 1 , . . . , | E ( G ) |} such that...
An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E ...
[[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 G with m edges is a bijection from E(G) to {1, 2,...,m} such that f...
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
An antimagic labeling of a graph G is a bijection f:E(G)→{1,…,|E(G)|} such that the weights w(x)=∑y∼...
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . ....
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...
An antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such...
AbstractAn antimagic labeling of a graph with M edges and N vertices is a bijection from the set of ...
An antimagic labeling for a graph $G$ with $m$ edges is a bijection $f: E(G) \to \{1, 2, \dots, m\}$...
A completely separating system (CSS) on a finite set [n] is a collection of subsets of [n] in which ...
Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E(G)$ to $\{1,2, \dots, m\}$. For...
An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective ma...
126 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.A labeling of a graph is a bi...
An antimagic labelling of a graph G is a bijection f : E ( G ) →{ 1 , . . . , | E ( G ) |} such that...
An undirected simple graph G = (V,E) is called antimagic if there exists an injective function f: E ...
[[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 G with m edges is a bijection from E(G) to {1, 2,...,m} such that f...
An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to...
An antimagic labeling of a graph G is a bijection f:E(G)→{1,…,|E(G)|} such that the weights w(x)=∑y∼...
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . ....
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...
An antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such...
AbstractAn antimagic labeling of a graph with M edges and N vertices is a bijection from the set of ...
An antimagic labeling for a graph $G$ with $m$ edges is a bijection $f: E(G) \to \{1, 2, \dots, m\}$...
A completely separating system (CSS) on a finite set [n] is a collection of subsets of [n] in which ...
Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E(G)$ to $\{1,2, \dots, m\}$. For...
An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective ma...
126 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.A labeling of a graph is a bi...
An antimagic labelling of a graph G is a bijection f : E ( G ) →{ 1 , . . . , | E ( G ) |} such that...