Apart from other labeling signed product and total signed product labeling already have been applied on different kind of graphs. Signed product cordial labeling for the graph G = (V, E), where each vertex is labelled by 1 or -1 and edge label is induced by multiplication of two of it end vertices with the following restriction that the absolute difference between total number of vertices labelled by 1 and -1 is at most 1, similarly for the edges also. Total signed product cordial labeling follows property that absolute difference between total number of vertices and edges labelled by -1 and total number of vertices and edges labelled by 1 is at most 1. In this paper, we have considered Cartesian product between two balanced bipartite graphs and apply above labeling on it. We have designed some suitable algorithms which will driven by any kind of computer programming language. Illustration with example and complexity of the algorithms are analysed successfully.
