(a,b)-Fibonacci-Legendre Cordial Graphs and k-Pisano-Legendre Primes
J. D. Andoyo

TL;DR
This paper introduces a new graph labeling concept based on $(a,b)$-Fibonacci numbers and Legendre primes, exploring its properties on various graph classes and operations.
Contribution
It defines $(a,b)$-Fibonacci-Legendre cordial labeling, analyzes its application to common graphs, and investigates properties and distribution of related $k$-Pisano-Legendre primes.
Findings
Established conditions for $(a,b)$-Fibonacci-Legendre cordial labeling on several graph types.
Explored the relationship between these labelings and $k$-Pisano-Legendre primes.
Presented conjectures on the density and growth of $k$-Pisano-Legendre primes.
Abstract
Let be an odd prime and let be the th -Fibonacci number with initial values and . For a simple connected graph , define a bijective function . If the induced function , defined by whenever and whenever , satisfies the condition where is the number of edges labeled (), then is called -Fibonacci-Legendre cordial labeling modulo . In this paper, the -Fibonacci-Legendre cordial labeling of path graphs, star graphs, wheel graphs, and graphs under the operations join, corona, lexicographic product, cartesian product, tensor product, and strong product is explored in relation to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
