Prime cordial labeling of some special graph families

Gaurang V Ghodasara, J. P Jena


A bijection f from vertex set V of a graph G to f1; 2; : : : ; jV jg is called a prime cordial labeling of G if each edge uv is assigned the label 1 if gcd(f(u); f(v)) = 1 and 0 if gcd(f(u); f(v)) > 1, where the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper we exhibit some new constructions on prime cordial graphs.

Full Text:



  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.