Related papers: Asymptotic Properties of Fibonacci Cubes and Lucas…
We show that the set of the numbers that are the sum of a prime and a Fibonacci number has positive lower asymptotic density.
By expressing Fibonacci and Lucas numbers in terms of the powers of the golden ratio, $\alpha=(1+\sqrt 5)/2$ and its inverse, $\beta=-1/\alpha=(1-\sqrt 5)/2$, a multitude of Fibonacci and Lucas identities have been developed in the…
In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…
Both Fibonacci and Lucas numbers can be described combinatorially in terms of 0-1 strings without consecutive ones. In the present article we explore the occupation numbers as well as the correlations between various positions in the…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, $k$-Fibonacci words, and their combinatorial properties. We established that the $n$-th root of the absolute value of terms in…
This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…
Let $\alpha=(1+\sqrt 5)/2$, the golden ratio, and $\beta=-1/\alpha=(1 - \sqrt 5)/2$. Let $F_n$ and $L_n$ be the Fibonacci and Lucas numbers, defined by $F_n=(\alpha^n -\beta^n)/\sqrt 5$ and $L_n=\alpha^n + \beta^n$, for all non-negative…
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $\Lambda_n$ is obtained from $\Gamma_n$ by removing vertices that start and end with 1. We…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
Since the $\mathrm{Fibonacci}$ sequence has good properties, it's important in theory and applications, such as in combinatorics, cryptography, and so on. In this paper, for the generalized Fibonacci sequence…
For each positive integer $k$, let $\mathscr{A}_k$ be the set of all positive integers $n$ such that $\gcd(n, F_n) = k$, where $F_n$ denotes the $n$th Fibonacci number. We prove that the asymptotic density of $\mathscr{A}_k$ exists and is…
Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many…
In this paper, we initiate the systematic study of density of algebraic points on surfaces. We give an effective asymptotic range in which the density degree set has regular behavior dictated by the index. By contrast, in small degree, the…
Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. We prove that $\#\left(\mathcal{A} \cap [1, x]\right) \gg x / \log x$ for all $x \geq 2$,…
We provide a sharp estimate for the asymptotic number of lattice zonotopes, inscribed in $[0,n ]^d$ when $n$ tends to infinity. Our estimate refines the logarithmic equivalent established by Barany, Bureaux, and Lund when the sum of the…
We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…
In analogy to a concept of Fibonacci trees, we define the leaf-Fibonacci tree of size $n$ and investigate its number of nonisomorphic leaf-induced subtrees. Denote by $f_0$ the one vertex tree and $f_1$ the tree that consists of a root with…
Let $G$ be a finite, connected graph. The eccentricity of a vertex $v$ of $G$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the arithmetic mean of the eccentricities of the vertices of $G$. We…
We present new values and bounds on the (normalised) closeness centrality $\bar{\mathsf{C}}_C$ of connected graphs and on its product $\bar{l}\bar{\mathsf{C}}_C$ with the mean distance $\bar{l}$ of these graphs. Our main result presents the…