FIBONACCI PRIME LABELING OF SNAKE GRAPHS

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 𝑔𝑐𝑑(𝑓(𝑢), 𝑓(𝑣)) = 1, where 𝑓(𝑢) and 𝑓(𝑣) are labels of any adjacent vertices u and v. Graphs formed by consecutively con...

Full description

Saved in:
Bibliographic Details
Published inJournal of mechanics of continua and mathematical sciences Vol. 20; no. 6; pp. 1 - 12
Main Authors Anna S. Varghese, Gerard Rozario Joseph, Lawrence Rozario Raj P.
Format Journal Article
LanguageEnglish
Published Institute of Mechanics of Continua and Mathematical Sciences 01.06.2025
Subjects
fibonacci prime graph
k-prime graph
snake graphs
Online AccessGet full text

Cover

More Information
Summary: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 𝑔𝑐𝑑(𝑓(𝑢), 𝑓(𝑣)) = 1, 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.
ISSN:0973-8975
2454-7190
DOI:10.26782/jmcms.2025.06.00001