Results 1 to 10 of about 2,249 (234)

Some results on one type of graph family with some special number sequences

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
In this study, we introduce a new graph family. Then, we calculate eigenvalues of the adjacency and the Laplacian matrix of this graph family. Moreover, we show that the perfect matching number of this graph family equals to special second order ...
Emrullah Kirklar   +2 more
doaj   +1 more source

Generalized Natural Density DF⁡(Fk) of Fibonacci Word

open access: yesVestnik KRAUNC: Fiziko-Matematičeskie Nauki
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, k-Fibonacci words, and their combinatorial properties.
Abdullah, D., Hamoud, J.
doaj   +1 more source

Complete k-ary trees and generalized meta-Fibonacci sequences [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
We show that a family of generalized meta-Fibonacci sequences arise when counting the number of leaves at the largest level in certain infinite sequences of k-ary trees and restricted compositions of an integer.
Chris Deugau, Frank Ruskey
doaj   +1 more source

Some properties of Fibonacci numbers, Fibonacci octonions, and generalized Fibonacci-Lucas octonions [PDF]

open access: yesAdvances in Difference Equations, 2015
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

Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
We introduce gaps that are edges or external pointers in AVL trees such that the height difference between the subtrees rooted at their two endpoints is equal to 2.
Mahdi Amani
doaj   +1 more source

Shifted Fibonacci Numbers

open access: yesAfyon Kocatepe University Journal of Sciences and Engineering, 2023
Shifted Fibonacci numbers have been examined in the literature in terms of the greatest common divisor, but appropriate definitions and fundamental equations have not been worked on. In this article, we have obtained the Binet formula, which is a fundamental equation used to obtain the necessary element of the shifted Fibonacci number sequence ...
openaire   +5 more sources

On Integer Numbers with Locally Smallest Order of Appearance in the Fibonacci Sequence

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2011
Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest natural number k such that n divides Fk. For instance, for all n=Fm≥5, we have z(n−1)>z(n)
Diego Marques
doaj   +1 more source

Fibonacci factoriangular numbers

open access: yesIndagationes Mathematicae, 2017
A recent conjecture is proved asserting that \(2, 5\), and \(34\) are the only Fibonacci numbers that are of the form \(n! + n(n+1)/2\) for some integer \(n\). The main tool to prove it is an upper bound for a non-zero \(p\)-adic linear form in two logarithms of algebraic numbers.
Gómez Ruiz, C.   +1 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy