Javascript must be enabled to continue!

Fibonacci Graphs

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.

MDPI AG

Aysun Yurttas Gunes Sadik Delen Musa Demirci Ahmet Sinan Cevik Ismail Naci Cangul

Symmetry

2020

Title: Fibonacci Graphs

Description:

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.

Back

Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...

Some Properties of the Fibonacci Sequence

The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationsh...

On parametric types of Apostol Bernoulli-Fibonacci, Apostol Euler-Fibonacci, and Apostol Genocchi-Fibonacci polynomials via Golden calculus

<abstract><p>This paper aims to give generating functions for the new family of polynomials, which are called parametric types of the Apostol Bernoulli-Fibonacci, the A...

Munarini graphs: a generalization of Fibonacci cubes and Pell graphs. Part I

The Fibonacci cube Γn is the subgraph of the hypercube Qn induced by vertices with no consecutive 1s. Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ter...

Independent Set in Neutrosophic Graphs

New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...

Failed Independent Number in Neutrosophic Graphs

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...

Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage

Abstract Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...

Exploring fibonacci cordiality in corona graphs

A Fibonacci cordial (FC) labeling of a graph G is an injective function f : V(G) → {F0, F1, …, Fn}, where Fi is the ith Fibonacci number, such that the induced edge labeling f*(uv)...

Email:
Password:

Email:

Fibonacci Graphs

Related Results