# IJPAM: Volume 56, No. 1 (2009)

**SOME CONSTRUCTIONS OF -SUPER MEAN GRAPHS**

Department of Mathematics

Govindammal Aditanar College for Women

Tiruchendur, Tamil Nadu, 628 215, INDIA

e-mail: [email protected]

Department of Mathematics

Dr. Sivanthi Aditanar College of Engineering

Tiruchendur, Tamil Nadu, 628 215, INDIA

e-mail: [email protected]

Department of Mathematics

Aditanar College of Arts and Science

Tiruchendur, Tamil Nadu, 628 215, INDIA

**Abstract.**Let be a graph and
be an injection. For each edge let
if is even and
if is odd. Then is called a super mean labeling if
A graph that admits a super mean labeling is called a super mean graph. Let be a graph and
be an injection. For each edge let
. Then is called a -super mean labeling if
A graph that admits a -super mean labeling is called a -super mean graph. In this paper we present super mean labeling of and -tree and also we construct some -super mean graphs.

**Received: **August 9, 2009

**AMS Subject Classification: **05C78

**Key Words and Phrases: **super mean labeling, super mean graph, -super mean labeling, -super mean graph

**Source:** International Journal of Pure and Applied Mathematics

**ISSN:** 1311-8080

**Year:** 2009

**Volume:** 56

**Issue:** 1