Abstract:
For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set V(G1(Tp)G2) =
V(G1) × V(G2) and edge set E(G1(Tp)G2) = {(u1, v1), (u2, v2)/u1u2 E(G1) and v1v2 E(G2)}. The graph Pm(Tp)Pn is
disconnected for ∀m, n while the graphs Cm(Tp)Cn and Cm(Tp)Pn are disconnected for both m and n even. We prove that
these graphs are product cordial graphs. In addition to this we show that the graphs obtained by joining the connected
components of respective graphs by a path of arbitrary length also admit product cordial labeling
