Cordial labeling of graphs

Cordial labeling of graphs
Author(s):
G Divya Dharshini, U Mary
Keywords:
Cordial labeling ,Splitting graph
Abstract
Let G={V,E} be a graph. A mapping f : V(G)→{0,1} is called Binary Vertex Labeling. A Binary Vertex Labeling of a graph G is called a Cordial Labeling if \|v_f (0)-v_f (1)\|≤1 and \|e_f (0)-e_f (1)\|≤1. A graph G is Cordial if it admits Cordial Labeling. Here, we prove that Sunlet graph (S_n) and Shell graph C_((n,n-3)) are Cordial and the Splitting graphs of them are also Cordial.
Article Details
Unique Paper ID: 147602 Publication Volume & Issue: Volume 5, Issue 9 Page(s): 165 - 167
Article Preview & Download

Volume 6 Issue 11

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Telephone:704 821 9842/43
Email: editor@ijirt.org
Website: ijirt.org