Supermagic Labeling of an s-duplicate of Kn,n

Wai Chee Shiu, Peter Che Bor Lam, Hee Lin Cheng

Research output: Contribution to journalJournal article


Let H and s be a graph and a positive integer respectively. An s-duplicate of H, denoted by sH, is a graph consisting of s identical components H. In this paper, we shall show that for n ≥ 2, sKn,n is supermagic if and only if n is even or both s and n are odd.
Original languageEnglish
Pages (from-to)119-124
Number of pages6
JournalCongressus Numerantium
Publication statusPublished - Dec 2000

User-Defined Keywords

  • Supermagic
  • orthogonal Latin square
  • balanced partition


Dive into the research topics of 'Supermagic Labeling of an s-duplicate of Kn,n'. Together they form a unique fingerprint.

Cite this