Cycle and path related graphs on l cordial labeling| International Journal of Innovative Science and Research Technology

Cycle and Path Related Graphs on L – Cordial Labeling

Authors : J. Arthy, Manimekalai K, Ramanathan. K

Volume/Issue : Volume 4 - 2019, Issue 6 - June

Google Scholar : https://goo.gl/DF9R4u

Abstract : In this work we establish TLn , DLn , Qn , DQn , ITn ,K1+K1,n, The generalized antiprism m An , Pn ʘK1, Hn , Hnʘ K1,m ̅̅̅̅̅̅ , Duplication of all edges of the Hn , Braid graph B(n) , Z- Pn , The duplication of every edge by a vertex in Cn are L – Cordial .

Keywords : L – Cordial Labeling (LCL), L – Cordial Graphs (LCG), Ladder, Snake, Path and Corona Graphs. AMS Classifications: 05C78.

In this work we establish TLn , DLn , Qn , DQn , ITn ,K1+K1,n, The generalized antiprism m An , Pn ʘK1, Hn , Hnʘ K1,m ̅̅̅̅̅̅ , Duplication of all edges of the Hn , Braid graph B(n) , Z- Pn , The duplication of every edge by a vertex in Cn are L – Cordial .

Keywords : L – Cordial Labeling (LCL), L – Cordial Graphs (LCG), Ladder, Snake, Path and Corona Graphs. AMS Classifications: 05C78.

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.