Divisor Cordial Labeling, Fibonacci Divisor Cordial Labeling, Vertex switching of Path Graph, Graph Theoretic Notations and Terminology, Joint Sum
1 article · search the full text for this term
-
Fibonacci Divisor Cordial Labeling of Different Graphs
Abstract: Fibonacci divisor of graph G with vertex set V (G)-Bijection f: V (G) → {F1, F2 ,. .. .. , Fp}, where Fi is the ith Fibonacci number. Therefore, if label 1 is assigned to each edge uv, if f (u) | f (v) or f (v) | f (u), mark 0 otherwise, then 0. The number of edges marked with 1 differs from the number of edges marked with …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 8, Issue 2, 2021 · pp. 38–45 Read article