___

• [1] B. Bollob´as, Extremal Graph Theory, Academic Press, London (1978), Pages 295 and 296.
• [2] J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York (1976).
• [3] B. Borovi´canin, K. Das, B. Furtula, I. Gutman, Bounds for Zagreb indices, MATCH Commun. Math. Comput. Chem. 78 (2017), 17–100.
• [4] Y. Caro, New results on the independence number, Technical Report, Tel-Aviv University, 1979.
• [5] C. S. Edwards and C. H. Elphick, Lower bounds for the clique and the chromatic numbers of a graph, Discrete Appl. Math., 5 (1983,) 51–64.
• [6] P. Erd˝os, On the graph theorem of Tur´an (in Hungarian), Mat. Lapok, 21 (1970), 249–251.
• [7] S. Filipovski, New bounds for the first Zagreb index, MATCH Commun Math Comput Chem., 54 (2005), 195–208.
• [8] I. Gutman and N. Trinajsti´c, Graph theory and molecular orbitals, total p–electron energy of alternant hydroncarbons, Chem. Phys. Lett., 17 (1972), 535–538.
• [9] X. Li and Z. Zheng, A unified approach to the extremal trees for different indices, MATCH Commun. Math. Comput. Chem,. 85(2021), 303–312.
• [10] V. K. Wei, A lower bound on the stability number of a simple graph, Bell Laboratories Technical Memorandum, No. 81-11217-9, 1981.