Abstract
Apart from its applications in Chemistry, Biology, Physics, Social Sciences, Anthropology, etc., there are close relations between graph theory and other areas of Mathematics. Fibonacci numbers are of utmost interest due to their relation with the golden ratio and also due to many applications in different areas from Biology, Architecture, Anatomy to Finance. In this paper, we define Fibonacci graphs as graphs having degree sequence consisting of n consecutive Fibonacci numbers and use the invariant Ω to obtain some more information on these graphs. We give the necessary and sufficient conditions for the realizability of a set D of n successive Fibonacci numbers for every n and also list all possible realizations called Fibonacci graphs for 1≤n≤4.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference15 articles.
1. On some applications of graph theory to number theoretic problems;Erdös;Publ. Ramanujan Inst.,1969
2. Fibonacci Cubes: A Class of Self-Similar Graphs;Hsu;Fib. Quart.,1993
3. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
4. A remark on the existence of finite graphs (Czech);Havel;Časopic Pěst. Mat.,1955
5. Extremal Problems on Components and Loops in Graphs
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献