M. Sundaram, R. Ponraj and S. Somosundram, “Product Cordial Labeling of Graph,” Bulletin of Pure and Applied Sciences, Vol. 23, No. 1, 2004, pp. 155-162.

has been cited by the following article:

• TITLE: Mean Cordial Labeling of Graphs

  AUTHORS: Raja Ponraj, Muthirulan Sivakumar, Murugesan Sundaram

  KEYWORDS: Path; Star; Complete Graph; Comb

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.4, November 1, 2012

  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.