Cordial labeling of graphs
G Divya Dharshini, U Mary
Cordial labeling ,Splitting graph
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

Share This Article

Go To Issue

Call For Paper

Volume 7 Issue 9

Last Date 25 February 2020

About Us enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on

Social Media

Google Verified Reviews

Contact Details