Results 31 to 40 of about 2,025 (185)
The Fibonacci numbers of certain subgraphs of circulant graphs
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo +1 more
doaj +1 more source
New Properties and Identities for Fibonacci Finite Operator Quaternions
In this paper, with the help of the finite operators and Fibonacci numbers, we define a new family of quaternions whose components are the Fibonacci finite operator numbers. We also provide some properties of these types of quaternions.
Nazlıhan Terzioğlu +2 more
doaj +1 more source
There are No Multiply-Perfect Fibonacci Numbers [PDF]
AbstractWe show that no Fibonacci number (larger than 1) divides the sum of its divisors.
Kevin A. Broughan +5 more
openaire +2 more sources
On the Bicomplex $k$-Fibonacci Quaternions
In this paper, bicomplex $k$-Fibonacci quaternions are defined. Also, some algebraic properties of bicomplex $k$-Fibonacci quaternions are investigated.
Fügen Torunbalcı Aydın
doaj +1 more source
Generalized Fibonacci Sequences for Elliptic Curve Cryptography
The Fibonacci sequence is a well-known sequence of numbers with numerous applications in mathematics, computer science, and other fields. In recent years, there has been growing interest in studying Fibonacci-like sequences on elliptic curves.
Zakariae Cheddour +2 more
doaj +1 more source
Edge-Disjoint Fibonacci Trees in Hypercube
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition similar to the Fibonacci numbers. In this paper, we prove that a hypercube of dimension h admits two edge-disjoint Fibonacci trees of height h, two edge ...
Indhumathi Raman, Lakshmanan Kuppusamy
doaj +1 more source
On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers
The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is
S.E. Rihane
doaj +1 more source
On Fibonacci (k,p)-Numbers and Their Interpretations
In this paper, we define new kinds of Fibonacci numbers, which generalize both Fibonacci, Jacobsthal, Narayana numbers and Fibonacci p-numbers in the distance sense, using the definition of a distance between numbers by a recurrence relation according to
Berke Cengiz, Yasemin Taşyurdu
doaj +1 more source
Construction of dual-generalized complex Fibonacci and Lucas quaternions
The aim of this paper is to construct dual-generalized complex Fibonacci and Lucas quaternions. It examines the properties both as dual-generalized complex number and as quaternion. Additionally, general recurrence relations, Binet's formulas, Tagiuri's (
G.Y. Şentürk, N. Gürses, S. Yüce
doaj +1 more source
Three new classes of binomial Fibonacci sums [PDF]
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients. One particular result is linked to a problem proposal recently published in the journal The Fibonacci Quarterly.
Robert Frontczak
doaj +1 more source

