Mean Cordial Labeling of Graphs

作     者：Raja Ponraj Muthirulan Sivakumar Murugesan Sundaram 

作者机构：Department of Mathematics Sri Paramakalyani College Alwarkurchi India Department of Mathematics Unnamalai Institute of Technology Kovilpatti India 

出 版 物：《Open Journal of Discrete Mathematics》 (离散数学期刊（英文）)

年 卷 期：2012年第2卷第4期

页      面：145-148页

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Path Star Complete Graph Comb 

摘      要：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.