MULTIPLY DIVISOR CORDIAL LABELING IN CONTEXT OF JOINT SUM OF GRAPHS
Print ISSN: 2319-1023 | Online ISSN: 2582-5461 | Total Downloads : 27
DOI: https://doi.org/10.56827/JRSMMS.2024.1102.12
Author :
J. T. Gondalia (Department of Mathematics, The Rajkumar College, Rajkot - 360001, Gujarat, INDIA)
Abstract
Multiply divisor cordial labeling of a graph $G^*$ having set of node $V^*$ is a bijective h from $V(G^*)$ to $\{1,2,...,|V(G^*)|\}$ such that an edge $xy$ is assigned the label 1 if 2 divides $(h(x) \cdot h(y))$ and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph having multiply divisor cordial labeling is said to be a multiply divisor cordial graph.
Keywords and Phrases
Multiply Divisor Cordial Labeling, Multiply Divisor Cordial Graph, Joint sum of graphs.
A.M.S. subject classification
05C76, 05C78.
.....
![](img/pdf_file_icon_32x32.png)