Pair mean cordial labeling of windmill, planar grid and quasi-flower snark graphs

Consider a [Formula: see text] graph [Formula: see text]. Define [Formula: see text] and [Formula: see text] referred to as the label set. Let us consider a mapping [Formula: see text], where, for every even [Formula: see text], distinct labels are assigned to the various elements of [Formula: see text] in [Formula: see text], and for every odd [Formula: see text], distinct labels are assigned to the [Formula: see text] elements of [Formula: see text] in [Formula: see text], with a repeating label for the lone vertex. After that, [Formula: see text] is referred to as a pair mean cordial labeling (PMC-labeling) if for every edge [Formula: see text] within [Formula: see text], there is a label for [Formula: see text] if [Formula: see text] is even and [Formula: see text] if [Formula: see text] is odd such that [Formula: see text] in which [Formula: see text] and [Formula: see text] denote the number of edges labeled with [Formula: see text] and the number of edges not labeled with [Formula: see text] in that order. A pair mean cordial graph (PMC-graph) is defined as a graph [Formula: see text] with PMC-labeling. In this paper, we discuss the PMC-labeling characteristics of a few unique graphs like windmill graph, planar grid, quasi-flower snark graph, complete flower graph, triple wheel graph, alternate triangular belt and lotus inside of a circle.