On L – Cordial Graphs

admin August 13, 2019

Authors:

J. Arthy,K. Manimekalai,K. Bhuvaneswari,

DOI NO:

https://doi.org/10.26782/jmcms.spl.2019.08.00079

Keywords:

L – Cordial Labeling (LCL),L – Cordial Graph (LCG),Ladder,Cube,Octahedron,

Abstract

In this paper we prove Ladder, Cube Q₃ , Octahedron, K2 + mK1 and jewel graphs are L –Cordial Graphs.

Refference:

I. Amit H Rokad, Kalpesh M.Patadiya,”Cordial
Aryabhatta Journal of Mathematics
597.
II. Frank Harary, “Graph Theory
III. Gallian J.A,”A dynamic survey of graph labeling
combinatroics 17(2010) # DS6.
IV. Mukund V Bapat
Labeling”, Internat
Technology(IJMTT)
V. Mukund V Bapat
Journal of Mathematics and its applications
460.
VI. Mukund V Bapat
International Journal of Statistics and applied Mathematics, 2018,3(2) 641
644.
VII. Selvam. A, Avadayappan
International Journal of Scientific and Engineering Research ,Vol.7,Issue
3(2013), 692-697.
VIII. Seoud. M.A, Shakir M.Salman,
2015,Issue 01,105
Advancement in Engineering, Science & Technology
No.-2, August (2019) pp
652
+mK1 and jewel Jn are L-Cordial Graphs
Labeling of some graphs
and Informations ,Vol.09 issue 0
Theory”, Narosa publishing House (2001).
labeling”, The electronic journal of
Bapat, ” Some Vertex Prime Graphs And A New Type Of Graph
International Journal of Mathematics Trends and
IJMTT), Vol 47 issue 01 pp:49-55, 2017
Bapat, “A note on L-cordial labeling of graph”, Interna
applications, Vol 5 issue 4-D (2017) ,457
Bapat, “New results on L-cordial labeling of Graphs
Avadayappan, R.Sinthu,”New families of supeer mean graphs
Salman,, “On Difference Cordial Graphs
01,105-124.

View | Download