ON FIBONACCI CORDIAL LABELING OF SOME PLANAR GRAPHS

An injective function f from vertex set V(G) of a graph G to the set {[F.sub.0], [F.sub.1], [F.sub.2], ***, [F.sub.n]}, where [F.sub.i] is the ith Fibonacci number (i = 0, 1, ***, n), is said to be Fibonacci cordial labeling if the induced function f* from the edge set E(G) the set {0, 1} defined by...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 15; no. 5; p. 1153
Main Authors Mitra, S, Pritchard, A, Bhoumik, S
Format Journal Article
LanguageEnglish
Published Turkic World Mathematical Society 01.05.2025
Subjects
Fuzzy sets
Graph theory
Mathematical research
Set theory
United States
Online AccessGet full text

Cover

More Information
Summary:An injective function f from vertex set V(G) of a graph G to the set {[F.sub.0], [F.sub.1], [F.sub.2], ***, [F.sub.n]}, where [F.sub.i] is the ith Fibonacci number (i = 0, 1, ***, n), is said to be Fibonacci cordial labeling if the induced function f* from the edge set E(G) the set {0, 1} defined by f*(uv) = (f(u) + f (v)) (mod 2) satisfies the condition |[e.sub.f](0) - [e.sub.f](1)| [less than or equal to] 1, where [e.sub.f] (0) is the number of edges with label 0 and [e.sub.f] (1) is the number of edges with label 1. A graph that admits Fibonacci cordial labeling is called a Fibonacci cordial graph. In this paper we discuss Fibonacci cordial labeling of the families of planar graph (Comb graphs, Coconut trees, Jellyfish Graphs, H-graph and W-graph). Keywords: Fibonacci Cordial labelling, Comb graph, Jellyfish, coconut tree, H-graph, W-graph. AMS Subject Classification: 05C78
ISSN:2146-1147