      - Cordial labeling of Some Cycle Related Graphs

Apply

      - Cordial labeling of Some Cycle Related Graphs

Journal Title: American journal of Engineering Research - Year 2016, Vol 5, Issue 10

Abstract

A p 2       - cordial labeling of a graph G with p vertices is a bijection f: V(G)  {1, 2, 3,…, p} defined by 1 (u) f(v) (e uv) 2 0 p if f f otherwise                and f f e (0) e (1) 1   . If a graph has p 2       - cordial labeling then it is called p 2       - cordial where p 2       represents the nearest integer less than or equal to 2 p In this paper we prove Cn is 2   p     - cordial graph for n ≥ 3, except for n = 4 and the graph obtained by duplication of an arbitrary vertex by a new edge in cycle Cn is 2   p     - cordial and the graph obtained by duplication of an arbitrary edge by a new vertex in cycle Cn is 2   p     -cordial. By a graph we mean a finite, undirected graph without multiple edges or loops. For graph theoretic terminology, we refer to Harary [2] and Bondy [1].

Authors and Affiliations

D. S. T. Ramesh1 ,, K. Jenita Devanesam2

Keywords

p 2       - cordial cycle

EP ID EP403995
DOI -
Views 39
Downloads 0