      - 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

Related Articles

Evaluation of Performance of an Indigenous Bambaranut Decorticating Machine

The performance of an indigenous Bambara groundnut decorticating machine was tested to make optimal use of locally developed decorticators as substitute for imported bambaranut decorticators. The test was based on the th...

Effect of Overageing Conditions on Microstructure and Mechanical Properties in Al–Si–Mg Alloy

Al-Si alloys have occupied significant position in the field of automobile applications. They are mainly used in engine parts where the alloys have to withstand high temperature for considerable length of time i.e ageing...

Modeling and Analysis of Floating-Ring Bearing ThermoHydrodynamic Parameters for Advanced Turbo-Rotor Systems

This work presents a detailed analysis and modeling of floating-ring bearings (FRBs) for predicting their dynamic-force coefficients, thermo-hydrodynamic characteristics, and instability behavior. The mathematical model...

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

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...

An Evaluation of Maas Service Effect Based On Real Travel Data

Recently, ‘Mobility as a Service’ (MaaS) is being introduced from Europe. The concept of MaaS is to move quickly, cheaply and efficiently by integrating all operation platform. However, in Korea, there is no integrated t...

Download PDF file
  • EP ID EP403995
  • DOI -
  • Views 59
  • Downloads 0

How To Cite

D. S. T. Ramesh1, , K. Jenita Devanesam2 (2016).       - Cordial labeling of Some Cycle Related Graphs. American journal of Engineering Research, 5(10), 90-95. https://europub.co.uk/articles/-A-403995