Wheel Related Intersection Cordial Labeling of Graphs

Abstract

An intersection cordial labeling of a graph G with vertex set $V$ is an injection $f$ from $V$ to the power set of $\{1, 2,\dots , n \}$ such that if each edge $uv$ is assigned the label $1$ if $f(u)\cap f(v)\neq \emptyset $ 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 an intersection cordial labeling, then it is called intersection cordial graph. In this paper, we proved the wheel related graphs are intersection cordial.