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

DOI10.1007/978-3-642-19222-7_24zbMATH Open1326.05136OpenAlexW1650024254MaRDI QIDQ3000511FDOQ3000511

Paulette Lieby, Mirka Miller, Leanne Rylands, Oudone Phanalasy

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

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

Cites Work

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

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000511)