Related papers: Fibonacci Identities and Graph Colorings
We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence,…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
We present a range of difficult integration formulas involving Fibonacci and Lucas numbers and trigonometric functions. These formulas are often expressed in terms of special functions like the dilogarithm and Clausen's function. We also…
At this paper, we derive some relationships between permanents of one type of lower-Hessenberg matrix and the Fibonacci and Lucas numbers and their sums.
In this paper, we give two new coding algorithms by means of right circulant matrices with elements generalized Fibonacci and Lucas polynomials. For this purpose, we study basic properties of right circulant matrices using generalized…
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
In this paper, we investigated properties of Tribonacci-Lucas polynomials which generalized Tribonacci-Lucas numbers. From this generalization, we also obtain some new algebraic properties on these numbers and polynomials as Binet formula,…
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…
This note gives an elementary exposition of a variant of the spread polynomials in terms of Fibonacci and Lucas polynomials.
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.
We give an overview about well-known basic properties of two classes of q-Fibonacci and q-Lucas polynomials and offer a common generalization.
More than ten years ago in 2008, a new kind of graph coloring appeared in graph theory, which is the {\it rainbow connection coloring} of graphs, and then followed by some other new concepts of graph colorings, such as {\it proper…
We combinatorially prove Tetranacci, Tetranacci-Fibonacci, and additional identities using only squares and dominoes on a hexagonal double-strip. Some of these are new proofs of old identities, and others we believe have never been seen…
The celebrated Erdos, Faber and Lovasz conjecture may be stated as follows: Any linear hypergraph on v points has chromatic index at most v. We will introduce the linear intersection number of a graph, and use this number to give an…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
This paper serves as the first extension of the topic of dominator colorings of graphs to the setting of digraphs. We establish the dominator chromatic number over all possible orientations of paths and cycles. In this endeavor we discover…
While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…