Open Journal of Discrete Mathematics

Volume 2, Issue 4 (October 2012)

ISSN Print: 2161-7635   ISSN Online: 2161-7643

Google-based Impact Factor: 0.64  Citations  

Mean Cordial Labeling of Graphs

HTML  Download Download as PDF (Size: 156KB)  PP. 145-148  
DOI: 10.4236/ojdm.2012.24029    6,985 Downloads   12,347 Views  Citations

ABSTRACT

Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and edges respectively labelled with x ( ). A graph with a mean cordial labeling is called a mean cor- dial graph. We investigate mean cordial labeling behavior of Paths, Cycles, Stars, Complete graphs, Combs and some more standard graphs.

Share and Cite:

Ponraj, R. , Sivakumar, M. and Sundaram, M. (2012) Mean Cordial Labeling of Graphs. Open Journal of Discrete Mathematics, 2, 145-148. doi: 10.4236/ojdm.2012.24029.

Cited by

[1] Balanced mean cordial labeling and graph operations
[2] Total Mean Cordial Labeling in Different Graphs
JOURNAL OF ALGEBRAIC …, 2022
[3] Group mean cordial labeling of some path and cycle related graphs
J. Math. Comput. Sci., 2022
[4] PD MEAN LABELING OF SPLITTING GRAPHS
2022
[5] SQUARE DIFFERENCE GEOMETRIC MEAN 3-EQUITABLE LABELING OF CERTAIN GRAPHS
2022
[6] A Labeling 'Sum Modulo Three'with Verification and an Application
Journal of Physics …, 2021
[7] Hmc Labeling Of Certain Types Of Graph
2021
[8] Mean Square Cordial Labeling Of Some Pentagonal Snake Graphs
2021
[9] PD mean cordial labeling of graphs
2020
[10] Modulo divisor cordial for path related graphs
Malaya Journal of Matematik, 2020
[11] Mean Cordial Labeling For Three Star Graph
2019
[12] Mean Square Cordial Labeling on Star Related Graphs
2019
[13] Mean Square Cordial Labeling of Some Snake Graphs
International Journal of Innovative Technology and Exploring Engineering, 2019
[14] Mean Cordial Labeling for Two Star Graphs
2019
[15] Mean Square Cordial Labeling of Some Cycle Related Graphs
International Journal of Engineering …, 2018
[16] IJMTT Call for Paper June-2022
2018
[17] Mean square cordial labelling related to some acyclic graphs and its rough approximations
Journal of Physics: Conference Series, 2018
[18] Few more results on Geometric Mean Labeling of graphs
International Journal of Mathematics Research, 2018
[19] Geometric Mean Cordial Labeling of Subdivision of Standard Graphs
2017
[20] Geometric mean cordial labeling of graphs
2017
[21] GEOMETRIC MEAN LABELING OF SOME CYCLE RELATED GRAPHS
International J. of Math. Sci. & Engg., 2017
[22] Geometric mean cordial labeling of graphs, Intnat
2017
[23] Mean Cordial Labelling of Some Star-Related Graphs
2016
[24] • SOME NEW RESULTS ON 1-NEAR MEAN CORDIAL LABELING OF GRAPHS
2016
[25] A Prototype of Rekeying Method Using Recursive Map Theory
International Journal of Engineering Trends and Technology (IJETT) , 2016
[26] SOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS
International Journal of Science, Engineering and Technology Research (IJSETR), 2016
[27] Mean Cordial Labeling of Tadpole and Olive Tree
Annals of Pure and Applied Mathematics , 2016
[28] 1 -Near Mean Cordial Labeling of ( ) 2n D P , ( ) nm PN+ (when n is even) ,Jelly Fish ( ), J mn graphs
International Journal of Mathematics Trends and Technology, 2015
[29] Mean cordiality of some snake graphs
Palestine Journal of Mathematics, 2015
[30] EXISTENCE AND NON EXISTENCE OF MEAN CORDIAL LABELING OF CERTAIN GRAPHS.
Journal of Prime Research in Mathematics, 2015
[31] POSTULATION OF GENERAL UNIONS OF DOUBLE LINES, LINES AND DOUBLE POINTS IN A PROJECTIVE SPACE
International Journal of Pure and Applied Mathematics, 2014
[32] Total Mean Cordial Labeling of Graphs
Mathematical Combinatorics, 2014
[33] Graph labeling
The Electronic Journal of Combinatorics, 2013
[34] On Mean Cordial Graphs
Mathematical Combinatorics, 2013
[35] Mean Cordial Labeling of Certain Graphs
Journal of Computer and Mathematical Sciences, 2013

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.