International Journal of Mathematics Trends and Technology
Volume 25 | Number 1 | Year 2015 | Article Id. IJMTT-V25P510 | DOI : https://doi.org/10.14445/22315373/IJMTT-V25P510
Let G=(V,E) be a simple graph. A surjective function f :V 0,1,2 is said to be a 1-Near Mean Cordial labeling if for each edge uv, the induced map
[1]. Gallian J.A, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics 6(2001)#DS6.
[2]. K.Palani,J.Rejila Jeya Surya, 1-Near Mean Cordial Labeling of Graphs,IJMA-6(7),July 2015 PP15-20.
[3]. K.Manimekalai, K.Thirusangu, Pair Sum Labeling of Some Special Graphs ,International Journal of Computing Algorithm, Vol.02, October 2013, Page:251-256.
[4]. A.Nellai Murugan and G.Esther, Some Results on Mean Cordial Graphs, International Journal of Mathematics Trends and Technology, ISSN: 2231-5373, Volume 11, No.2, July 2014.
[5]. Raja Ponraj, Muthirulan Sivakumar and Murugesan Sundaram, Mean Cordial Labeling of Graphs, Open Journal of Discrete Mathematics 2012,2,145-148.
[6]. Albert William I, Indra Rajasingh and S.Roy, Mean Cordial Labeling of Certain Graphs, Journal of Computer and Mathematical Sciences, Vol. 4, Issue 4,31 August, 2013 Pages(202-321).
[7]. F.Harary, Graph Theory,Addison-Wesley Publishing Company Inc, USA,1969.
S.Sriram, Dr.R.Govindarajan, "1 -Near Mean Cordial Labeling of D2 (Pn) ,Pn (+) Nm(when n is even), Jelly Fish J (m,n) graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 25, no. 1, pp. 55-58, 2015. Crossref, https://doi.org/10.14445/22315373/IJMTT-V25P510
PDF 
Abstract 
Keywords 
References 
Citation