FP-cordial labeling of product and corona-related graphs
Raja Ponraj, T. Sutharson · Discrete Mathematics Algorithms and Applications · 2026
Let [Formula: see text] be a [Formula: see text] graph. Let [Formula: see text] Let [Formula: see text] be a bijection. For each edge [Formula: see text], assign the label [Formula: see text].[Formula: see text] is called a fractional product cordial labeling (simply called FP-cordial labeling) if [Formula: see text] where [Formula: see text] and [Formula: see text] respectively, denotes the number of edges labelled with [Formula: see text] and not labelled with [Formula: see text]. A graph with a fractional product cordial labeling is called a fractional product cordial graph (Simply FP-cordial graph). In this paper, we investigate the fractional product cordial labeling behavior of planar grid graph, [Formula: see text], mongolian tent graph, double arrow graph, [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text].