Open Access
Subscription Access
Graph Labeling in Competition Graph
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.
Keywords
Cayley Digraphs, Graph Labeling, A-Magic
User
Information
- Andar M, Boxwala S and Limaye N (2005) On the cordiality of the t-ply Pt(u,v). Ars. Combin. 77, 245- 259.
- Annexstein F, Baumslag M and Rosenberg AL (1990) Group action graphs and parallel architectures. SIAM J. Comput.19, 544-569.
- Bala E and Thirusangu K (2011) Some graph labelings in competition graph of Cayley digraphs. Intl. J. Combinatorial Graph Theory & Appl. (in press).
- Cahit J (1987) Cordial graphs; a weaker version of graceful and harmonious graphs. Ars. Combin. 23, 201-207.
- Cahit J (1990) On Cordial and 3-equitable labelings of graphs. Util. Math. 37, 189-198.
- Gallian JA (2009) A dynamic survey of graph labeling. The Electronic J. Combinatrics. 16, DS6.
- Heydemann M (1997) Cayley graphs and interconnection networks. In: Graph symmetry: Algebraic methods and Applications. Hahn G & Sabidussi G (Eds). pp: 167-224.
- Rosa A (1967) On certain valuations of the vertices of a graph. In: Theory of graphs. Intl. Symp., Rome, (July 1996), Gordon and Breach, N.Y. and Dunod Paris. pp: 349-355.
- Thirusangu K, Baskar Babujee J and Rajeswari R (2009) On antimagic labelings in Cayley’s Digraphs. Intl. J. Math. Appl. 2(1-2), 11-16.
- Thirusangu K, Atulya K. Nagar and Rajeswari R (2011) Labelings in Cayley’s Digraphs. Eur. J. Combinatrics. 32, 133-139.
- Yilmaz R and Cahit I (1997) E-cordial graphs. Ars. Combin. 46, 251-266.
- Youssef MZ (2006) On Skolem-graceful and cordial graphs. Ars. Combin. 78, 167-177.
Abstract Views: 523
PDF Views: 97