2009
DOI: 10.1016/j.dam.2008.08.028
|View full text |Cite
|
Sign up to set email alerts
|

Fibonacci numbers and Lucas numbers in graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
8
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 3 publications
1
8
0
Order By: Relevance
“…Very similar results were obtained by Startek et al [94], who studied graphs with two elementary (disjoint) cycles.…”
Section: Its Hosoya Index Issupporting
confidence: 75%
“…Very similar results were obtained by Startek et al [94], who studied graphs with two elementary (disjoint) cycles.…”
Section: Its Hosoya Index Issupporting
confidence: 75%
“…A wealth of theoretical results on these two parameters has been obtained in recent years, in particular regarding trees and tree-like structures (such as unicyclic graphs [3][4][5] or bicyclic graphs [6,7]). Upper and lower bounds are known under various restrictions, such as diameter [8], number of leaves [9], or number of cut edges [10].…”
Section: Introductionmentioning
confidence: 99%
“…The Golden Number is closely related to the Fibonacci sequence which is defined recursively by F n = F n−1 + F n−2 for n ≥ 2 with the initial terms F 0 = F 1 = 1. Some new interesting properties and applications of the Fibonacci sequence were studied in [34,35].…”
Section: The Exact Results Of the Diagonalizationmentioning
confidence: 99%