Supermagic Labeling of an s-duplicate of Kn,n

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

Supermagic Labeling of an s-duplicate of K_n,n

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

Department of Mathematics

Research output: Contribution to journal › Journal article

Abstract

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, sK_n,nis supermagic if and only if n is even or both s and n are odd.

Original language	English
Pages (from-to)	119-124
Number of pages	6
Journal	Congressus Numerantium
Volume	146
Publication status	Published - Dec 2000

User-Defined Keywords

Supermagic
orthogonal Latin square
balanced partition

Cite this

@article{90d175b4d0494190a3f3d3641479aeab,

title = "Supermagic Labeling of an s-duplicate of Kn,n",

abstract = "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.",

keywords = "Supermagic, orthogonal Latin square, balanced partition",

author = "Shiu, {Wai Chee} and Lam, {Peter Che Bor} and Cheng, {Hee Lin}",

note = "Funding information: Partially supported by Faculty Research Grant, Hong Kong Baptist University; and Research Grant Council Grant, Hong Kong. Publisher copyright: {\textcopyright} 2000, Utilitas Mathematica Publishing Incorporated",

year = "2000",

month = dec,

language = "English",

volume = "146",

pages = "119--124",

journal = "Congressus Numerantium",

issn = "0384-9864",

publisher = "Utilitas Mathematica Publishing",

}

TY - JOUR

T1 - Supermagic Labeling of an s-duplicate of Kn,n

AU - Shiu, Wai Chee

AU - Lam, Peter Che Bor

AU - Cheng, Hee Lin

N1 - Funding information: Partially supported by Faculty Research Grant, Hong Kong Baptist University; and Research Grant Council Grant, Hong Kong. Publisher copyright: © 2000, Utilitas Mathematica Publishing Incorporated

PY - 2000/12

Y1 - 2000/12

N2 - 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.

AB - 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.

KW - Supermagic

KW - orthogonal Latin square

KW - balanced partition

M3 - Journal article

SN - 0384-9864

VL - 146

SP - 119

EP - 124

JO - Congressus Numerantium

JF - Congressus Numerantium

ER -

Supermagic Labeling of an s-duplicate of Kn,n

Abstract

User-Defined Keywords

Fingerprint

Cite this

Supermagic Labeling of an s-duplicate of K_n,n