Irregularity and topological indices in Fibonacci word trees and modified Fibonacci word index
https://doi.org/10.22405/2226-8383-2025-26-3-257-273
Abstract
This paper introduces the concept of the Fibonacci Word Index FWI, a novel topological index derived from the Albertson index, applied to trees constructed from Fibonacci words.
Building upon the classical Fibonacci sequence and its generalizations, we explore the structural properties of Fibonacci word trees and their degree-based irregularity measures. We define the FWI and its variants, including the total irregularity and modified Fibonacci Word Index where it defined as
and establish foundational inequalities relating these indices to the maximum degree of the underlying trees. Our results extend known graph invariants to the combinatorial setting of Fibonacci words, providing new insights into their algebraic and topological characteristics. Additionally, we present analytical expressions involving Fibonacci numbers and their generating functions, supported by Binet’s formula, to facilitate computation of these indices. The theoretical developments are illustrated with examples, including detailed constructions of Fibonacci word trees and their degree distributions. This work opens avenues for further investigation of word-based graph invariants and their applications in combinatorics and theoretical computer science.
About the Authors
Jasem Hamoud
Moscow Institute of Physics and Technology (National Research University)
Russian Federation
Russian Federation
postgraduate student
Duaa Abdullah
Moscow Institute of Physics and Technology (National Research University)
Russian Federation
Russian Federation
postgraduate student
References
1. Berstel, J. 1986, “Fibonacci words—a survey”, in Rozenberg, G. and Salomaa, A. (eds.) The Book of L. Berlin: Springer, pp. 13–27.
2. Rigo, M. 2014, Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words. Hoboken, NJ: Wiley. Available at: https://doi.org/10.1002/9781119008200
3. Zhi-Xiong, W., Zhi-Ying, W. 1994, “Some properties of the singular words of the Fibonacci word”, European Journal of Combinatorics, 15(6), pp. 587–598.
4. Gutman, I., Furtula, B. 2012, “Trees with smallest atom–bond connectivity index”, MATCH Communications in Mathematical and in Computer Chemistry, 68, pp. 131–136.
5. Monnerot-Dumaine, A. 2009, The Fibonacci Word Fractal [Preprint]. Available at: https://hal.archives-ouvertes.fr/hal-00367972
6. Glen, A. 2006, “On Sturmian and episturmian words, and related topics”, Bulletin of the Australian Mathematical Society, 74(1), pp. 155–160.
7. Furtula B., Gutman I., Ivanovich M., Vukichevich D. 2012, “Computer search for trees with minimal ABC index”, Applied Mathematics and Computation, 219(2), pp. 767–772.
8. Viswanath, D. 2000, “Random Fibonacci sequences and the number 1.13198824...”, Mathematics of Computation, 69(231), pp. 1131–1155.
9. Gutman, I., Furtula, B., Ivanovi´c, M. 2012, “Notes on trees with minimal atom-bond connectivity index”, MATCH Communications in Mathematical and in Computer Chemistry, 67, pp. 467–482.
10. Gutman I., Hansen P., Melo H. 2005, “Variable neighborhood search for extremal graphs. 10. Comparison of irregularity indices for chemical trees”, Journal of Chemical Information and Modeling, 45(2), pp. 222–230.
11. Ram´ırez, J.L., Rubiano, G.N. 2013, “On the k-Fibonacci words”, Acta Universitatis Sapientiae, Informatica, 5, pp. 212–226. https://doi.org/10.2478/ausi-2014-0011
12. Kari L., Kulkarni M.S., Mahalingam K., Wang Z. 2021, “Involutive Fibonacci words”, Journal of Automata, Languages and Combinatorics, 26, pp. 255–280.
13. Gutman, I., Trinajsti´c, N., Wilcox, C.F. 1975, “Graph theory and molecular orbitals. XII. Acyclic polyenes”, Journal of Chemical Physics, 62(9), pp. 3399–3405.
14. Hamoud, J., Kurnosov, A. 2024, “Sigma index in trees with given degree sequences”, arXiv [Preprint]. Available at: https://doi.org/10.48550/arXiv.2405.05300
15. Kalman, D., Mena, R. 2003, “The Fibonacci numbers—exposed”, Mathematics Magazine, 76(3), pp. 167–181. https://doi.org/10.1080/0025570X.2003.11953176
16. Gutman, I., Trinajsti´c, N. 1972, “Graph theory and molecular orbitals. Total 𝜑-electron energy of alternant hydrocarbons”, Chemical Physics Letters, 17(4), pp. 535–538.
17. Abdo, H., Brandt, S., Dimitrov, D. 2014, “The total irregularity of a graph”, Discrete Mathematics & Theoretical Computer Science, 16(Graph Theory), pp. 201–206.
18. Knuth, D.E. 1997, The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd edn. Boston: Addison-Wesley.
19. Albertson, M.O. 1997, “The irregularity of a graph”, Ars Combinatoria, 46, pp. 219–226.
20. Vassilieva, E.A. 2014, “On Jack’s connection coefficients and their computation”, Chebyshevskii Sbornik, 15(1), pp. 65–76 (in Russian). https://doi.org/10.22405/2226-8383-2014-15-1-65-76
21. Rampersad, N., Wiebe, M. 2023, “Correlations of minimal forbidden factors of the Fibonacci word”, arXiv [Preprint]. Available at: arXiv:2309.07070
22. Avanesov, E.T., Gusev, V.A. 2014, “Units and linear recurrent sequences”, Chebyshevskii Sbornik, 15(3), pp. 4–11 (in Russian). https://doi.org/10.22405/2226-8383-2014-15-3-4-11
23. Hamoud, J., Abdullah, D. 2025, “Improvement ergodic theory for the infinite word F = F𝑏 := (𝑏𝑓𝑛)𝑛⩾0 on Fibonacci density”, arXiv [Preprint]. Available at: https://doi.org/10.48550/arXiv.2504.05901
24. MathOverflow (n.d.) “Is the density of 1s in the Fibonacci word uniform?”. Available at: https://mathoverflow.net/questions/323614/is-the-density-of-1s-in-the-fibonacci-worduniform.
25. Pulido H.F., Ramirez H.L., Vindas-Melendez A.R. 2024, “Generating trees and Fibonacci polyominoes”, arXiv [Preprint]. Available at: arXiv:2411
26. Yousaf S., Bhatti A.A., Ali A. 2019, “A note on the modified Albertson index”, arXiv [Preprint]. Available at: https://doi.org/10.48550/arXiv.1902.01809
27. Hosseini S.A., Ahmadi M.B., Gutman I. 2014, “Kragujevac trees with minimal atom-bond connectivity index”, MATCH Communications in Mathematical and in Computer Chemistry, 71(20), pp. 5–20.
Review
For citations:
Hamoud J., Abdullah D. Irregularity and topological indices in Fibonacci word trees and modified Fibonacci word index. Chebyshevskii Sbornik. 2025;26(3):257-273. (In Russ.) https://doi.org/10.22405/2226-8383-2025-26-3-257-273
Views:
57
Email this article 