In this paper we shall show applications of the Fibonacci numbers in edge-coloured trees. In particular we determine the successive extremal graphs in the class of trees with respect to the number of (A, 2B)-edge colourings. We show connections between these numbers and Fibonacci numbers as well as the telephone numbers
In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
AbstractIn (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and...
We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation...
An edge-coloring of a graph G is an assignment of colors or labels to the edges of the graph. If {A,...
In this paper we determine successive extremal trees with respect to the number of all \((A,2B)\)-ed...
Fibonacci trees are special binary trees which are of natural interest in the study of data structur...
A tree is said to be a Fibonacci tree if all the vertices can be labelled with n Fibonacci numbers s...
We show a new property of Fibonacci numbers which is related to the analysis of a very simple and na...
Wydział Matematyki i InformatykiW rozprawie zostały przedstawione rezultaty dotyczące ciągów typu Fi...
Abstract. We look at a family of meta-Fibonacci sequences which arise in studying the number of leav...
We determine the smallest and the largest number of (A,B,2C)-edge colourings in trees. We prove that...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduc...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
AbstractIn (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and...
We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation...
An edge-coloring of a graph G is an assignment of colors or labels to the edges of the graph. If {A,...
In this paper we determine successive extremal trees with respect to the number of all \((A,2B)\)-ed...
Fibonacci trees are special binary trees which are of natural interest in the study of data structur...
A tree is said to be a Fibonacci tree if all the vertices can be labelled with n Fibonacci numbers s...
We show a new property of Fibonacci numbers which is related to the analysis of a very simple and na...
Wydział Matematyki i InformatykiW rozprawie zostały przedstawione rezultaty dotyczące ciągów typu Fi...
Abstract. We look at a family of meta-Fibonacci sequences which arise in studying the number of leav...
We determine the smallest and the largest number of (A,B,2C)-edge colourings in trees. We prove that...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduc...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
AbstractIn (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and...
DOI
Add to ORKG