Fuzzy Quotient-3 Cordial Labeling on some Unicyclic Graphs with Pendant Edges

Abstract

Consider a non-trivial, simple, undirected graph  having a vertex set  with vertices and edge sets  with  edges. Let the function

defined by  and for each   the induced  function   assigns the label for   where  Then  is called fuzzy quotient 3 cordial labeling if  and . For  and  represent the number of vertices and edges assigned the labels   respectively, If a graph admit this labeling, then it is fuzzy quotient 3 cordial. The existence of above labeling on ,  and are examined and the results are provided in this paper.