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.
|Number of pages||6|
|Publication status||Published - Dec 2000|
- orthogonal Latin square
- balanced partition