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

Scribd : https://bit.ly/2XDhKTx

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.

CALL FOR PAPERS


Paper Submission Last Date
31 - October - 2021

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

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
OR

Subscribe by RSS

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