TY - GEN
T1 - On antimagic labeling for generalized web and flower graphs
AU - Ryan, Joe
AU - Phanalasy, Oudone
AU - Miller, Mirka
AU - Rylands, Leanne
PY - 2011
Y1 - 2011
N2 - ![CDATA[An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling. Completely separating systems arose from certain problems in information theory and coding theory. Recently these systems have been shown to be useful in constructing antimagic labelings of particular graphs.]]
AB - ![CDATA[An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling. Completely separating systems arose from certain problems in information theory and coding theory. Recently these systems have been shown to be useful in constructing antimagic labelings of particular graphs.]]
UR - http://handle.uws.edu.au:8081/1959.7/542787
UR - http://www.iwoca.org/iwoca2010/
M3 - Conference Paper
SN - 9783642192210
SP - 303
EP - 313
BT - Combinatorial Algorithms: 21st International Workshop, IWOCA 2010 London, UK, July 26-28, 2010: Revised Selected Papers
PB - Springer
T2 - International Workshop on Combinatorial Algorithms
Y2 - 26 July 2010
ER -