Results 21 to 30 of about 30,407 (243)
Fibonacci number of the tadpole graph
Electronic 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
Machine learning for the classification of serial electron diffraction patterns: synthetic data. [PDF]
Acta Crystallogr A Found AdvMachine learning based sorting of synthetic serial electron diffraction patterns into 2D zonal patterns and patterns representing intersections of multiple Laue zones is demonstrated. The extracted zonal patterns can be used for the determination of unit‐cell parameters.Serial electron crystallography faces a fundamental challenge due to the flat Ewald
Gorelik TE, Gorelik E.
europepmc +2 more sources
2-Fibonacci polynomials in the family of Fibonacci numbers [PDF]
Notes on Number Theory and Discrete Mathematics, 2018 In the present study, we define new 2-Fibonacci polynomials by using terms of a new family of Fibonacci numbers given in [4]. We show that there is a relationship between the coefficient of the 2-Fibonacci polynomials and Pascal's triangle. We give some identities of the 2-Fibonacci polynomials.
Ozkan, Engin +2 more
openaire +2 more sources
New Properties and Identities for Fibonacci Finite Operator Quaternions
Mathematics, 2022 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]
, 2011 Here, we show that no Fibonacci number (larger than 1) divides the sum of its ...
Alain Togbé +9 more
core +2 more sources
The Fibonacci numbers of certain subgraphs of circulant graphs
AKCE 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
A weighted extension of Fibonacci numbers
Journal of Difference Equations and Applications, 2023 14 pages, comments ...
Bhatnagar, Gaurav +2 more
openaire +3 more sources
Some properties of the generalized (p,q)- Fibonacci-Like number
MATEC 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
Mathematics, 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 the harmonic and hyperharmonic Fibonacci numbers [PDF]
Advances in Difference Equations, 2015 In this paper, we study the theory of the harmonic and the hyperharmonic Fibonacci numbers. Also, we get some combinatoric identities like as harmonic and hyperharmonic numbers and we obtain some useful formulas for $\mathbb{F}_{n}$, which is finite sums of reciprocals of Fibonacci numbers.
KESİM, SEYHUN +2 more
openaire +6 more sources