TY - JOUR
T1 - An application of completely separating systems to graph labeling
AU - Rylands, Leanne
AU - Phanalasy, Oudone
AU - Ryan, Joe
AU - Miller, Mirka
PY - 2013
Y1 - 2013
N2 - In this paper a known algorithm used for the construction of completely separating systems (CSSs), Roberts’ Construction, is modified and used in a variety of ways to build CSSs. The main interest is in CSSs with different block sizes. A connection between CSSs and vertex antimagic edge labeled graphs is then exploited to prove that various non-regular graphs are antimagic. An outline for an algorithm which produces some of these non-regular graphs together with a vertex antimagic edge labeling is presented.
AB - In this paper a known algorithm used for the construction of completely separating systems (CSSs), Roberts’ Construction, is modified and used in a variety of ways to build CSSs. The main interest is in CSSs with different block sizes. A connection between CSSs and vertex antimagic edge labeled graphs is then exploited to prove that various non-regular graphs are antimagic. An outline for an algorithm which produces some of these non-regular graphs together with a vertex antimagic edge labeling is presented.
UR - http://handle.uws.edu.au:8081/1959.7/535070
U2 - 10.1007/978-3-642-45278-9_32
DO - 10.1007/978-3-642-45278-9_32
M3 - Article
SN - 0302-9743
VL - 8288
SP - 376
EP - 387
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
ER -