[1] K. Dutta, D. Mubayi and C. R. Subramanian, New lower bounds for the independence number of sparse graphs and hypergraphs, SIAM J. Discrete Math. 26 (2012) 1134–1147, https://doi.org/10.1137/110839023.
[2] T. Hofmeister and H. Lefmann, Approximating maximum independent sets in uniform hypergraphs, in : International Symposium on Mathematical Foundations of Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 1998.
[3] A. Kostochka, D. Mubayi and J. Verstraëte, On independent sets in hypergraphs, Random Struct. Algorithms. 44 (2014) 224–239.
[4] D. Mubayi and V. Rödl, On the chromatic number and independence number of hypergraph products, J. Combin. Theory Ser. B 97 (2007) 151–155, https://doi.org/10.1016/j.jctb.2006.03.005.
[5] T. Thiele, A lower bound on the independence number of arbitrary hypergraphs, J. Graph Theory 30 (1999) 213–221, https://doi.org/10.1002/(SICI)10970118(199903)30:3<213::AID-JGT6>3.0.CO;2-Q.
[6] C. Berge, Hypergraphs: Combinatorics of Finite Sets, 45, Elsevier, 1984.
[7] Z. Hu, X. Li and D. Peng, Graphs with minimum vertex-degree function index for convex functions, MATCH Commun. Math. Comput. Chem. 88 (2022) 521–533.
[8] J. Huang and H. Zhang, Extremal vertex-degree function index with given order and dissociation number, Discrete Appl. Math. 342 (2024) 142–152, https://doi.org/10.1016/j.dam.2023.09.005.
[9] I. Tomescu, Properties of connected (n;m)-graphs extremal relatively to vertex- degree function index for convex functions, MATCH Commun. Math. Comput. Chem. 85 (2021) 285–294.
[10] I. Tomescu, Extremal vertex-degree function index for trees and unicyclic graphs with given independence number, Discrete Appl. Math. 306 (2022) 83–88, https://doi.org/10.1016/j.dam.2021.09.028.
[11] I. Tomescu, Graphs with given cyclomatic number extremal relatively to vertex- degree function index for convex functions, MATCH Commun. Math. Comput. Chem. 87 (2022) 109–114, https://doi.org/ 10.46793/match.87-1.109T.
[12] Z. Li, L. Shi, L. Zhang, H. Ren and F. Li, On Sombor index for uniform hypergraphs, MATCH Commun. Math. Comput. Chem. 94 (2025) 229–246.
[13] S. Madabhavi, S. S. Shetty, K. A. Bhat and S. Hanif, Energy and Sombor energy of hypergraphs via a matrix, Kragujevac J. Math. 51 (2027) 505–525.
[14] S. S. Shetty and K. A. Bhat, Sombor index of hypergraphs, MATCH Commun. Math. Comput. Chem. 91 (2024) 235–254, https://doi.org/10.46793/match.91-1.235S.
[15] S. S. Shetty and K. A. Bhat, The forgotten index of hypergraphs and some hypergraph operations, Commun. Comb. Optim. Articles in Press, (2025), https://doi.org/10.22049/cco.2025.30434.2466.
[16] G. H. Shirdel, A. Mortezaee and L. Alameri, General Randic index of uniform hypergraphs, Iranian J. Math. Chem. 14 (2023) 121–133, https://doi.org/10.22052/ijmc.2023.252836.1712.
[17] G. H Shirdel, A Mortezaee and L Alaameri, Randic matrix and Randic energy of uniform hypergraphs, Math. Interdisc. Res. 9 (2024) 269–288, https://doi.org/10.22052/mir.2024.254116.1456.
[18] T. Vetrik, Degree-based indices of hypergraphs: definitions and first results, Asian-Eur. J. Math. 17 (2024) #2450023,
https://doi.org/10.1142/S1793557124500232.
[19] H. Wang, P. Yin and Y. Li, On the general sum-connectivity index of hypergraphs, AIMS Math. 10 (2025) 22092–22105, https://doi.org/10.3934/math.2025983.
[20] X. Wang and M. Wang, Sombor index of uniform hypergraphs, AIMS Math. 9 (2024) 30174–30185, https://doi.org/10.3934/math.20241457.
[21] S. S. Shetty and K. A. Bhat, Vertex-degree-based topological indices of uniform directed hypergraphs, Arab J. Basic Appl. Sci. 32 (2025) 347–360, https://doi.org/10.1080/25765299.2025.2555676.