An application of completely separating systems to graph labeling

DOI10.1007/978-3-642-45278-9_32MaRDI QIDQ2870043zbMATH OpenOpenAlexFDO

Authors Oudone Phanalasy, Mirka Miller, Leanne Rylands, Joe Ryan

Publication date 17 January 2014

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-45278-9_32

zbMATH Keywords

antimagic labelingcompletely separating systemnon-regular graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On a relationship between completely separating systems and antimagic labeling of regular graphs
• Construction for antimagic generalized web graphs
• Combinatorial configurations in the definition of antimagic labelings of graphs
• On antimagic labeling for generalized web and flower graphs
• Antimagic labeling of regular graphs

Cited in

(4)

• Antimagicness of generalized corona and snowflake graphs
• Antimagic labelings of join graphs
• On a relationship between completely separating systems and antimagic labeling of regular graphs
• scientific article; zbMATH DE number 919838 (Why is no real title available?)

This page was built for publication: An application of completely separating systems to graph labeling

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