Graph labeling in competition graph

E Bala

doi:10.17485/ijst/2011/v4i8.17

Abstract

In this paper we present an algorithm and prove the existence of graph labelings such as Z3- magic, E-cordial, total Ecordial, Product cordial, total product cordial, Product E-cordial, total product E-cordial labelings for the competition graph of the Cayley digraphs associated with Zn. AMS Subject classification: 05C78 Keywords: Cayley digraphs, Graph labeling, A- magic

Highlights

A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions
In this paper we present an algorithm and prove the existence of graph labelings such as Z3- magic, E-cordial, total Ecordial, Product cordial, total product cordial, Product E-cordial, total product E-cordial labelings for the competition graph of the Cayley digraphs associated with Zn
In this paper we prove the existence of graph labelings such as Z3 magic, E-cordial, total E-cordial, Product cordial, total product cordial, Product E-cordial, total product E-cordial for the competition graph of the Cayley digraphs associated with Zn. 2

Summary

Introduction

A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. It is said to admit total product E-cordial labeling if there exists a function f from E onto the set {0,1} such that the induced map f* on V is defined as f*(vi) = Π {f(vi vj) / vi vj ∈ E}(mod 2) satisfies the property that that the number of vertices

Results

Conclusion