[
[1] J. -L. Baril and P. T. Do, ECO-Generation for p-generalized Fibonacci and Lucas permutations, PU.M.A., 17(2006) (1–2), 19–37.
]Search in Google Scholar
[
[2] N. Fernando and M. H. Rashid, Fibonacci Permutation Polynomials, Manuscript, December 2017, available at https://www.researchgate.net/publication/321994479_Fibonacci_PermutationPolynomials (accessed at 2022 June).
]Search in Google Scholar
[
[3] E. Foundas, C. Patsakis and G. Chondrocoukis, Lucas permutations and some notes on Fibonacci permutations, Journal of Discrete Mathematical Sciences and Cryptography, Volume 11, 2008(2), 181–190.10.1080/09720529.2008.10698175
]Search in Google Scholar
[
[4] M. L. Fredman, R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the Association for Computing Machinery, 34(3) (1987), 596–615.10.1145/28869.28874
]Search in Google Scholar
[
[5] C. D. Godsil, Inverses of trees, Combinatorica, 5(1985), 33–39.10.1007/BF02579440
]Search in Google Scholar
[
[6] T. Koshy, Fibonacci and Lucas Numbers with Applications, Volume 1, Second Edition, John Wiley & Sons, Hoboken NJ, USA, 2018.10.1002/9781118742297
]Search in Google Scholar
[
[7] J. W. Layman, Entries A097082 and A097083 in OEIS (2004).
]Search in Google Scholar
[
[8] Y. V. Matiyasevic, Hilbert’s tenth problem, Foundations of Computing Series, MIT Press, Cambridge, MA, 1993. Translated from the 1993 Russian original by the author; With a foreword by Martin Davis.
]Search in Google Scholar
[
[9] OEIS, The On-Line Encyclopedia of Integer Sequences, https://oeis.org/, Founded in 1964 by N.J.A. Sloan.
]Search in Google Scholar
