Divisor cordial labeling in context of ring sum of graphs

Gaurang V Ghodasara, Divya G Adalja


A graph $G=(V,E)$ is said to have a divisor cordial labeling if there is a bijection $f :V(G)\rightarrow\{1,2,\ldots|V(G)|\}$ such that if 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 derive divisor cordial labeling of ring sum of different 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.