Fuzzy Quotient-3 cordial labeling on some unicyclic graphs with pendant edges

Consider the graph G, which is non-trivial, simple, undirected, connected and finite with p vertices and q edges. V(G) and E(G) are the vertex and edge sets of G, respectively. Let σ be the mapping from V (G) into [0, 1] defined by σ(α)=α10,α ∈ Z4 − {0} and for each αβ ∈ E(G), the induced mapping µ from E(G) into [0, 1] defined by μ (α β) = 110⌈3σ(α)σ(β)⌉ where σ (α) ≤ σ (β). Let νσ (κ) and eµ (κ) indicate the number of vertices and the number of edges assigned the value κ. If for k≠l ∈ {r10,r∈ Z4 − {0}}, |vσ(k) − vσ(l)| ≤ 1 and |eμ(k) −eμ(l)| ≤ 1, then σ is called fuzzy quotient 3 cordial labeling. Graph G is said to be fuzzy quotient 3 cordial if it admit the above labeling. The presence of above labelling is investigated on some unicyclic graphs with pendant edges such as Cτ (P2, S1,3) and Cτ (P2, S1,3,S1,3) and the results are presented in this paper.