Divisor cordial labeling in context of ring sum of graphs

Gaurang V Ghodasara, Divya G Adalja


A graph $G=(V,E)$ said to have a divisor cordial labeling if there is a bijection $f:\{1, 2,\ldots , |V(G)|\}$ such that each edge $e=uv$ is assigned the label 1 if $f(u) | f(v) $ or $ f(v)| f(u)$ and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has a divisor cordial labeling then it is called divisor cordial graph. In this paper we have derived divisor cordial labeling of ringsum of different graphs.

Full Text:



  • There are currently no refbacks.

Comments on this article

View all comments

Web Counters

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