[1] K.Ch. Das, “Maximizing the sum of the squares of the degrees of a graph,” Discrete Math., vol. 285, no. 1-3, pp. 57-66, 2004, doi: 10.1016/j.disc.2004.04.007.
[2] K.Ch. Das, “Sharp bounds for the sum of the squares of the degrees of a graph,” Kragujevac J. Math., vol. 25, no. 25, pp. 31-49, 2003.
[3] Y.S. Yoon and J.K. Kim, “A relationship between bounds on the sum of squares of degrees of a graph,” J. Appl. Math. Comput., vol. 21, pp. 233-238, 2006, doi: 10.1007/BF02896401.
[4] F.R. McMorris and T. Zaslavsky, “The number of cladistic characters,” Math. Biosci., vol. 54, no. 1–2, pp. 3-10, 1981, doi: 10.1016/0025-5564(81)90071-7.
[5] S. Rasouli and F. Khaksar Haghami, “Maximal, prime and minimal prime filters in residuated lattices,” Soft Comput. J., vol. 11, no. 1, pp. 106-119, 2022, doi: 10.22052/scj.2023.243375.1032 [In Persian].
[6] K. Fathalikhani and A.R. Ashrafi, “Metric and combinatorial properties of fibonacci and lucas cubes,” Soft Comput. J., vol. 5, no. 1, pp. 78-100, 2017 [In Persian].
[7] A. Khaleghi Tabar and R. Farazkhish, “Routing improvement for vehicular Ad Hoc networks (VANETs) using nature inspired algorithms,” Soft Comput. J., vol. 6, no. 2, pp. 72-85, 2018, dor: 20.1001.1.23223707.1396.6.2.6.0 [In Persian].
[8] D. de Caen, “An upper bound on the sum of the squares of the degrees in a graph,” Discrete Math., vol. 185, on. 1-3, pp. 245-248, 1998, doi: 10.1016/S0012-365X(97)00213-6.
[9] M. Liu and B. Liu, “Some properties of the first general Zagreb index,” Australas. J. Combin., vol. 47, pp. 285-294, 2010.
[10] M. Eliasi and A. Ghalavand, “Extremal trees with respect to some versions of zagreb indices via majorization,” Iranian J. Math. Chem., vol. 8, no. 4, pp. 391-401, 2017, doi: 10.22052/ijmc.2017.46693.1161.
[11] A. Ghalavand, A.R. Ashrafi, and I. Gutman, “Extremal graphs for the second multiplicative Zagreb index,” Bull. Int. Math. Virtual Inst., vol. 8, no. 2, pp. 369-383, 2018.