Results 21 to 30 of about 2,057 (213)

Fibonacci number of the tadpole graph

open access: yesElectronic Journal of Graph Theory and Applications, 2014
In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2) and the Fibonacci number of the cycle ...
Joe DeMaio, John Jacobson
doaj   +1 more source

The Fibonacci numbers of certain subgraphs of circulant graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2015
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

Some properties of the generalized (p,q)- Fibonacci-Like number

open access: yesMATEC Web of Conferences, 2018
For the real world problems, we use some knowledge for explain or solving them. For example, some mathematicians study the basic concept of the generalized Fibonacci sequence and Lucas sequence which are the (p,q) – Fibonacci sequence and the (p,q ...
Suvarnamani Alongkot
doaj   +1 more source

Generalized Fibonacci Sequences for Elliptic Curve Cryptography

open access: yesMathematics, 2023
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

On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2021
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 the Bicomplex $k$-Fibonacci Quaternions

open access: yesCommunications in Advanced Mathematical Sciences, 2019
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

Construction of dual-generalized complex Fibonacci and Lucas quaternions

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2022
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

On the arrowhead-Fibonacci numbers

open access: yesOpen Mathematics, 2016
AbstractIn this paper, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix of the characteristic polynomial of thek-step Fibonacci sequence and then we give some of their properties. Also, we study the arrowhead-Fibonacci sequence modulomand we obtain the cyclic groups from the generating matrix of the arrowhead-Fibonacci numbers ...
Deveci, Omur, GÜLTEKİN, İnci
openaire   +4 more sources

On Fibonacci (k,p)-Numbers and Their Interpretations

open access: yesSakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2023
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

Edge-Disjoint Fibonacci Trees in Hypercube

open access: yesJournal of Computer Networks and Communications, 2014
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

Home - About - Disclaimer - Privacy