- Title
- An application of completely separating systems to graph labeling
- Creator
- Rylands, Leanne; Phanalasy, Oudone; Ryan, Joe; Miller, Mirka
- Relation
- 24th International Workshop on Combinatorial Algorithms (IWOCA 2013). Proceedings of the 24th International Workshopon Combinatorial Algorithms [presented in Combinatorial Algorithms Vol. 8288] (Rouen, France 10-12 July, 2013) p. 376-387
- Publisher Link
- http://dx.doi.org/10.1007/978-3-642-45278-9_32
- Publisher
- Springer
- Resource Type
- conference paper
- Date
- 2013
- Description
- 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.
- Subject
- completely separating system; antimagic labeling; non-regular graph
- Identifier
- http://hdl.handle.net/1959.13/1317910
- Identifier
- uon:23536
- Identifier
- ISBN:9783642452772
- Language
- eng
- Reviewed
- Hits: 1542
- Visitors: 996
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|