Vertex-magic total labelings of even complete graphs

DOI10.1016/j.disc.2011.01.004zbMath1216.05128OpenAlexW2038438155MaRDI QIDQ533773

Addie Armstrong, Daniel McQuillan

Publication date: 6 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.01.004

zbMATH Keywords

labelingspectrumcomplete graphvertex-magic

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

The existence spectrum for regular sparse anti-magic squares ⋮ Towards generalizing MacDougall's conjecture on vertex-magic total labelings

Cites Work

• A conjecture on strong magic labelings of 2-regular graphs
• Magic labelings of triangles
• Vertex-magic labelings of regular graphs. II.
• Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling
• Vertex-magic total labeling of odd complete graphs
• Vertex‐Magic Total Labelings of Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex-magic total labelings of even complete graphs