Signed Product Cordial Labeling in Structured and Recursive Graph

Abstract

This investigation explores signed product cordial labeling in some structured graph and families of recursive graph, the specifically snake graph, triangular snake graph and cactus graph. These type of graphs hierarchical and repetitive structures of making them the suitable for such labelings. We establish the sufficient conditions for the existence of the signed product cordial labeling and this provide explicit labeling schemes for each of the class. The result id deepen the understanding of the behavior of labeling in complex graph structures and offer the basis for the further research into the modular graph of labeling algorithm.