On a relationship between completely separating systems and antimagic labeling of regular graphs

Oudone Phanalasy; Mirka Miller; Leanne Rylands; Paulette Lieby

On a relationship between completely separating systems and antimagic labeling of regular graphs

Oudone Phanalasy, Mirka Miller, Leanne Rylands, Paulette Lieby

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

15 Citations (Scopus)

Abstract

![CDATA[A completely separating system (CSS) on a finite set [n] is a collection of subsets of [n] in which for each pair a ≠ b ∈ [n], there exist A, B ∈ C such that a ∈ A, b ∉ A and b ∈ B, a ∉ B. 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. In this paper we show that there is a relationship between CSSs on a finite set and antimagic labeling of graphs. Using this relationship we prove the antimagicness of various families of regular graphs.]]

Original language	English
Title of host publication	Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010: Revised Selected Papers
Publisher	Springer
Pages	238-241
Number of pages	4
ISBN (Print)	9783642192210
Publication status	Published - 2011
Event	International Workshop on Combinatorial Algorithms - Duration: 26 Jul 2010 → …

Conference

Conference	International Workshop on Combinatorial Algorithms
Period	26/07/10 → …

Cite this

@inproceedings{67b74ffaf1ea46ca952d84899b10b4a9,

title = "On a relationship between completely separating systems and antimagic labeling of regular graphs",

abstract = "![CDATA[A completely separating system (CSS) on a finite set [n] is a collection of subsets of [n] in which for each pair a ≠ b ∈ [n], there exist A, B ∈ C such that a ∈ A, b ∉ A and b ∈ B, a ∉ B. 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. In this paper we show that there is a relationship between CSSs on a finite set and antimagic labeling of graphs. Using this relationship we prove the antimagicness of various families of regular graphs.]]",

author = "Oudone Phanalasy and Mirka Miller and Leanne Rylands and Paulette Lieby",

year = "2011",

language = "English",

isbn = "9783642192210",

pages = "238--241",

booktitle = "Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010: Revised Selected Papers",

publisher = "Springer",

note = "International Workshop on Combinatorial Algorithms ; Conference date: 26-07-2010",

}

On a relationship between completely separating systems and antimagic labeling of regular graphs. / Phanalasy, Oudone; Miller, Mirka; Rylands, Leanne et al.
Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010: Revised Selected Papers. Springer, 2011. p. 238-241.

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

TY - GEN

T1 - On a relationship between completely separating systems and antimagic labeling of regular graphs

AU - Phanalasy, Oudone

AU - Miller, Mirka

AU - Rylands, Leanne

AU - Lieby, Paulette

PY - 2011

Y1 - 2011

N2 - ![CDATA[A completely separating system (CSS) on a finite set [n] is a collection of subsets of [n] in which for each pair a ≠ b ∈ [n], there exist A, B ∈ C such that a ∈ A, b ∉ A and b ∈ B, a ∉ B. 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. In this paper we show that there is a relationship between CSSs on a finite set and antimagic labeling of graphs. Using this relationship we prove the antimagicness of various families of regular graphs.]]

AB - ![CDATA[A completely separating system (CSS) on a finite set [n] is a collection of subsets of [n] in which for each pair a ≠ b ∈ [n], there exist A, B ∈ C such that a ∈ A, b ∉ A and b ∈ B, a ∉ B. 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. In this paper we show that there is a relationship between CSSs on a finite set and antimagic labeling of graphs. Using this relationship we prove the antimagicness of various families of regular graphs.]]

UR - http://handle.uws.edu.au:8081/1959.7/542763

UR - http://www.iwoca.org/iwoca2010/

M3 - Conference Paper

SN - 9783642192210

SP - 238

EP - 241

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 -

On a relationship between completely separating systems and antimagic labeling of regular graphs

Abstract

Conference

Other files and links

Fingerprint

Cite this