Abstract:
For the graph G = (V (G), E(G)), a function f : V (G) →
{0, 1} is called a product cordial labeling of G if the induced edge labeling
function defined by the product of end vertex labels be such that the edges
with label 1 and label 0 differ by at most 1 and the vertices with label 1 and
label 0 also differ by at most 1. Here we investigate product cordial labeling
for some bistar related graphs.
