
doi: 10.4171/zaa/725
The paper deals with polynomials characterized by coefficients determined by successive elements of the Fibonacci sequence. Basic properties and applications of the Fibonacci polynomials are demonstrated. The index of concentration of Fibonacci polynomials at k -th degree, locations of their zeros and optimization procedures for such polynomials are discussed. Illustrative examples are presented.
network theory, zeros of polynomials, Fibonacci and Lucas numbers and polynomials and generalizations, Fibonacci polynomials, Circuits, networks
network theory, zeros of polynomials, Fibonacci and Lucas numbers and polynomials and generalizations, Fibonacci polynomials, Circuits, networks
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
