Cordial and 3-equitable Labeling for Some Wheel Related Graphs.docVIP

IAENG International Journal of Applied Mathematics, 41:2, IJAM_41_2_03 ______________________________________________________________________________________ Cordialand3-equitableLabelingforSomeWheel RelatedGraphs SKVaidya,NADani,KKKanani,PLVihol Abstract—We present here cordial and 3-equitable labeling good radar type codes and convolution codes with optimal forthegraphsobtainedbyjoiningapexverticesoftwowheels autocorrelation properties. Labeled graph plays vital role in toanewvertex.Weextendtheseresultsforkcopiesofwheels. thestudyofX-Raycrystallography,communicationnetwork and to determine optimal circuit layouts. A detailed study onvarietyofapplicationsofgraphlabelingiscarriedoutin BloomandGolomb[3]. Index Terms—Cordial graph, Cordial labeling, 3-equitable graph, 3-equitable labeling AMSSubject classi?cation number(2000):05C78. De?nition 1.4 Let G = (V,E) be a graph. A mapping f :V(G)→{ 0,1}iscalledbinaryvertexlabelingofGand I. INTRODUCTION W iscalledthe ofthevertexv of under . f(v) For an edge e f? : E(G) → {0,1} is given by f (e) |f(u)?f(v)| . Let be the number of vertices of G having labels label G f E begin with simple, ?nite and undirected graph G = (V,E). In the present work Wn = C +K1 = uv, the induced edge labeling ? = n (n≥3)denotesthewheelandinW verticescorrespondto n , vf(0) v (1) C are called rim vertices and vertex which corresponds to f n 0 and 1 respectively under f and let numberofedgeshavinglabels0and1respectivelyunderf?. e (0)e (1) be the , K is called an apex vertex. For all other terminology and notationswefollowHarary[7].Wewillgivebriefsummary ofde?nitionswhichareusefulforthepresentinvestigations. f f 1 De?nition 1.5 A binary vertex labeling of a graph G is called a cordial labeling if |v (0) ? v (1)| ≤ 1 and De?nition 1.1 Consider two wheels W(1) and W(2) f G f is cordial if it admits n n |e (0)?e (1)| ≤ 1. A graph thenG=W(1):W(2)isthegraphobtainedbyjoining f f n n cordiallabeling. The concept of cor