Graph labeling in competition graph

E  Bala and K  Thirusangu

doi:10.17485/ijst/2011/v4i8.17

Article

VIEWS 798
PDF 434

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2011/v4i8.17

Year: 2011, Volume: 4, Issue: 8, Pages: 938-943

Original Article

Graph labeling in competition graph

E. Bala and K. Thirusangu^*

Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600073, India
[email protected]; [email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

Abstract

In this paper we present an algorithm and prove the existence of graph labelings such as Z₃- 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 Z_n. AMS Subject classification: 05C78
Keywords: Cayley digraphs, Graph labeling, A- magic