Results 91 to 100 of about 4,031 (226)
Fibonacci and Telephone Numbers in Extremal Trees
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.
Bednarz Urszula, Włoch Iwona
doaj +1 more source
Some properties of Fibonacci numbers, Fibonacci octonions, and generalized Fibonacci-Lucas octonions [PDF]
In this paper we determine some properties of Fibonacci octonions. Also, we introduce the generalized Fibonacci-Lucas octonions and we investigate some properties of these elements.
openaire +3 more sources
On the number of complex horadam sequences with a fixed period
The Horadam sequence is a direct generalization of the Fibonacci numbers in the complex plane, depending on a family of four complex parameters: two recurrence coefficients and two initial conditions.
Larcombe, Peter J., Bagdasar, Ovidiu
core
The p-adic valuation of Lucas sequences
Let (un)n≥0 be a nondegenerate Lucas sequence with characteristic polynomial X2 − aX − b, for some relatively prime integers a and b. For each prime number p and each positive integer n, we give simple formulas for the p-adic valuation νp(un), in terms ...
Sanna, Carlo
core
Fast Algorithms of Fibonacci number and Lucas number
Recursive calculation formulae of Fibonacci series or Lucas series can be rewritten into algebraic forms of matrices and vectors.
4674 +4 more
core
Fibonacci numbers: A population dynamics perspective
Fibonacci numbers or Fibonacci sequence is among the most popular numbers or sequence in Mathematics. In this paper, we discuss the sequence in a population dynamics perspective. We discuss the early development of the sequence and interpret the sequence
Asep K. Supriatna +2 more
doaj +1 more source
This article looks into the importance of the Fibonacci numbers within Computer Science, commenting on how to compute a Fibonacci number. It introduces an efficient test as to whether or not a number is Fibonacci, and proves the correctness of this test.
Phillip James
core
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and ...
Bruyère, Véronique +3 more
core +1 more source
Total Graph Interpretation of the Numbers of the Fibonacci Type
We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give
Urszula Bednarz +2 more
doaj +1 more source
For an integer k≥ 2, let (Fn(k))n be the k-Fibonacci sequence which starts with 0,...,0,1 (k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we find all k-Fibonacci numbers which are Mersenne numbers, i.e., k-Fibonacci numbers that are equal to 1 less than a power of 2.
Bravo, Jhon J., Gómez, Carlos A.
openaire +3 more sources

