Vertex magic total labellings of complete graphs

MaRDI QIDQ2765169zbMATH OpenFDO

Authors Mirka Miller, Yuqing Lin

Publication date 13 October 2002

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

complete graphvertex magic total labeling

Mathematics Subject Classification ID

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

Review text

The authors provide the missing piece in proving that every complete graph is vertex magic. The paper contains two constructions that settle the previously open cases.

Cited in

(12)

• Magic labelings of triangles
• Vertex-antimagic labelings of regular graphs
• Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling
• Algorithms for computing parameters of graph-based extensions of BCH codes
• Vertex Antimagic Total Labeling of Digraphs
• Vertex-antimagic total labelings of graphs
• scientific article; zbMATH DE number 2076808 (Why is no real title available?)
• scientific article; zbMATH DE number 2104716 (Why is no real title available?)
• Vertex-magic total labelings of even complete graphs
• scientific article; zbMATH DE number 6269011 (Why is no real title available?)
• scientific article; zbMATH DE number 5238589 (Why is no real title available?)
• Threshold protocol game on graphs with magic square-generalization labelings

This page was built for publication: Vertex magic total labellings of complete graphs

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