On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs

DOI10.1007/978-3-642-19222-7_24zbMath1326.05136OpenAlexW1650024254MaRDI QIDQ3000511

Paulette Lieby, Mirka Miller, Oudone Phanalasy, Leanne J. Rylands

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_24

zbMATH Keywords

regular graphantimagic labelingcompletely separating systemvertex antimagic edge labeling

Mathematics Subject Classification ID

Extremal set theory (05D05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Antichains and completely separating systems -- a catalogue and applications ⋮ Antimagic labeling of generalized pyramid graphs ⋮ On Antimagic Labeling for Generalized Web and Flower Graphs ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Unnamed Item ⋮ Antimagic labelings of join graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On anti-magic labeling for graph products
• A new class of antimagic Cartesian product graphs
• The antimagicness of the Cartesian product of graphs
• Completely separating systems of \(k\)-sets
• A dynamic survey of graph labeling
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• On a problem concerning separating systems of a finite set
• Computing and Combinatorics

This page was built for publication: On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs