Kth FIBONACCI PRIME LABELING OF SNAKE GRAPHS
Anna S Varghese, Gerard Rozario Joseph, Lawrence Rozario Raj P · JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES · 2025
kth Fibonacci Prime Labeling is defined as labeling the vertices of a graph with distinct Fibonacci numbers starting since the kth Fibonacci term sustaining the condition that the , where and are labels of any adjacent vertices u and v. Graphs formed by consecutively connecting identical base graphs, linearly or in alternating pattern, is called Snake graph. In this paper, we show that some snake graphs admit kth Fibonacci prime labeling.