Difference Perfect Square Cordial Labeling
Abstract
Graph is said to have a Difference perfect square cordial labeling if there is a bijection map hence for each edge the induced map is defined by,
if
otherwise
and where number of edges with label zero, number of edges with label one.
In this paper we obtain Difference perfect square cordial labeling for Path, Cycle, Wheel graph, Fan graph, Comb graph, Crown graph, graph, graph, graph, , graph, Two copies of sharing a common edge , A vertex switching of , Shipping graph.