๐๐๐ 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!
|
| 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 |