[1] S. Alikhani and N. Ghanbari, Sombor index of polymers, MATCH Commun. Math. Comput. Chem. 86 (2021), no. 3, 715–728.
[2] B. Borovi´canin, B. Furtula, and M. Jerotijevi´c, On the minimum Harary index of graphs with a given diameter or independence number, Discrete Appl. Math. 320 (2022), 331–345.
https://doi.org/10.1016/j.dam.2022.06.008
[12] I. Gutman, Geometric approach to degree-based topological indices: Sombor indices, MATCH Commun. Math. Comput. Chem. 86 (2021), no. 1, 11–16.
[14] B. Horoldagva and C. Xu, On Sombor index of graphs, MATCH Commun. Math. Comput. Chem. 86 (2021), no. 3, 703–713.
[16] Y. Orlovich, A. Dolgui, G. Finke, V. Gordon, and F. Werner, The complexity of dissociation set problems in graphs, Discrete Appl. Math. 159 (2011), no. 13, 1352–1366.
https://doi.org/10.1016/j.dam.2011.04.023
[22] J. Tu, Z. Zhang, and Y. Shi, The maximum number of maximum dissociation sets in trees, J. Graph Theory 96 (2021), no. 4, 472–489.
https://doi.org/10.1002/jgt.22627
[23] A. Vasilyev, R. Darda, and D. Stevanović, Trees of given order and independence number with minimal first Zagreb index, MATCH Commun. Math. Comput. Chem. 72 (2014), no. 3, 775–782.