Strona: Distance Fibonacci Polynomials by Graph Methods / Department of Complex Systems

Distance Fibonacci Polynomials by Graph Methods

2021-11-03
, red. Bartosz Kowal
Logo: symmetry

A new volume of Symmetry brings a paper authored by D. Strzalka. A. Włoch and S. Wolski about Distance Fibonacci Polynomials by Graph Methods. This paper is a study of a new generalization of Fibonacci polynomials which generalize Fibonacci, Jacobsthal and Narayana numbers, simultaneously is given. A graph interpretation of these polynomials is shown and a binomial formula for them was obtained. Moreover, by modification of Pascal’s triangle, which has a symmetric structure, matrices generated by coefficients of generalized Fibonacci polynomials were given. As a consequence, the direct formula for generalized Fibonacci polynomials was shown. In addition, matrix generators for generalized Fibonacci polynomials, using the symmetric matrix of initial conditions, were obtained.

See more details on page:

https://www.mdpi.com/2073-8994/13/11/2075

Back to news list