Contents

-

Some C4- supermagic Graphs

P. Jeyanthi1, P. Selvagopal2
1Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur 628 215, India
2Department of Mathematics, Lord Jegannath College of Engineering & Technology, PSN Nagar, Ramanathichanputhur, Marungoor 629 402, India.

Abstract

A simple graph G=(V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. We say that G is H-magic if there exists a total labeling f:VE{1,2,,|V|+|E|+1} such that for each subgraph H=(V,E) of G isomorphic to H,
vVf(v)+eEf(e)
is constant.

When f(V)={1,2,,|V|}, then G is said to be H-supermagic.

In this paper, we show that all prism graphs Cn×Pm, except for n=4, the ladder graph P3×Pn, and the grid P3×Pn, are C4-supermagic.