𝒌𝒕𝒉 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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mechanics of Continua and Mathematical Sciences
2025-06-01
|
| Series: | Journal of Mechanics of Continua and Mathematical Sciences |
| Subjects: | |
| Online Access: | https://jmcms.s3.amazonaws.com/wp-content/uploads/2025/06/14190312/jmcms-2506050-Kth-Fibinacci-prime-labeling-of-snake-graphs-Gerard.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|