Cite

[1] C. Adiga, A. Bayad, I. Gutman, S. A. Srinivas, The minimum covering energy of a graph, Kragujevac J. Sci., 34 (2012), 39–56. ⇒219, 220, 229Search in Google Scholar

[2] A. Alhevaz, M. Baghipur, H.S. Ramane, Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs, Le Matematiche, (2018), in press. ⇒22110.2478/ausi-2018-0011Search in Google Scholar

[3] N. Alon, Eigenvalues and expanders, Combinatorica, 6 (1986), 83–96. ⇒22310.1007/BF02579166Search in Google Scholar

[4] G. E. Backus, J. F. Gilbert, Numerical applications of a formalism for geophysical inverse problems, Geophys. J. R. Ustr. Soc., 13 (1967), 247–276. ⇒23710.1111/j.1365-246X.1967.tb02159.xSearch in Google Scholar

[5] J.A.Bondy, U.S.R. Murty, Graph Theory with Applications, Springer, Macmillan, New York, 1976. 1976. ⇒23210.1007/978-1-349-03521-2Search in Google Scholar

[6] M. Biernacki, H. Pidek, C. Ryll-Nardzewski, Sur une inégalité entre des intégrales définies. (French) Ann. Univ. Mariae Curie-Sklodowska. Sect. A.4 (1950), 1–4. ⇒237Search in Google Scholar

[7] Z. Chen, Spectra of extended double cover graphs, Czechoslovak J. Math., 54 (2004), 1077–1082. ⇒22310.1007/s10587-004-6452-2Search in Google Scholar

[8] J. B. Diaz, F. T. Metcalf, Stronger forms of a class of inequalities of G. Pólya–G. Szegö, and L.V. Kantorovich, Bull. Amer. Math. Soc., 69 (1963), 415–418. ⇒23410.1090/S0002-9904-1963-10953-2Search in Google Scholar

[9] K. Ch. Das, K. Xu, I. Gutman, On Zagreb and Harary Indices, MATCH Commun. Math. Comput. Chem., 70 (2013), 301–314 ⇒231, 232Search in Google Scholar

[10] K. Ch. Das, B. Zhou, N. Trinajstić, Bounds on Harary index, J. Math. Chem., 46 (2009), 1377–1393. ⇒231, 23310.1007/s10910-009-9522-8Search in Google Scholar

[11] P. J. Davis, Circulant Matrices, John Wiley and Sons, New York, 1979. ⇒222Search in Google Scholar

[12] I. Gutman, The energy of a graph, Ber. Math-Statist. Sekt. Forschungsz. Graz103 (1978), 1–22. ⇒219Search in Google Scholar

[13] I. Gutman, The energy of a graph: old and new results, Algebraic Combinatorics and Applications, A. Betten, A. Kohnert, R. Laue and A. Wassermann, eds., Springer, Berlin, (2001), pp. 196–211. ⇒21910.1007/978-3-642-59448-9_13Search in Google Scholar

[14] I. Gutman, B. Zhou, Laplacian energy of a graph, Linear Algebra Appl., 414 (2006), 29–37. ⇒21910.1016/j.laa.2005.09.008Search in Google Scholar

[15] A. Ilić, G.Yu, L. Feng, The Hararyindexoftrees, Utilitas Math., 87 (2012), 21–32. ⇒231Search in Google Scholar

[16] G. Indulal, R. Balakrishnan, Distance spectrum of Indu-Bala product of graphs, AKCE Int. J. Graphs Combin., 13 (2016), 230–234. ⇒22410.1016/j.akcej.2016.06.012Search in Google Scholar

[17] O. Ivanciuć, T.S. Balaban, A.T. Balaban, Reciprocal distance matrix, related local vertex invariants and topological indices, J. Math. Chem.12 (1993), 309–318. ⇒220, 22110.1007/BF01164642Search in Google Scholar

[18] N. Ozeki, On the estimation of inequalities by maximum and minimum values, J. College Arts Sci. Chiba Univ., 5(2) (1968), 199–203. ⇒234Search in Google Scholar

[19] D. Plavšić, S. Nikolić, N. Trinajstić, Z.Mihalić, On the Harary index for the characterization of chemical graphs, J. Math. Chem., 12 (1993), 235–250. ⇒22110.1007/BF01164638Search in Google Scholar

[20] G. Pólya, G.Szegö, Problems and Theorems in Analysis, Series, Integral Calculus, Theory of Functions (Classics in Mathematics), Springer, Berlin, 1972. ⇒234Search in Google Scholar

[21] M. R. Rajesh Kanna, B.N. Dharmendra, G. Sridhara, Minimum covering distance energy of a graph, Appl. Math. Sci., 7(11) (2013), 5525–5536. ⇒21910.12988/ams.2013.38477Search in Google Scholar

[22] M. R. Rajesh Kanna, B.N. Dharmendra, R. Pradeep Kumar, Minimum covering Harary energy of a graph, Int. J. Pure. Appl. Math., 90(3) (2014), 371–385. ⇒219, 220, 22910.12732/ijpam.v90i3.10Search in Google Scholar

[23] H. Wang, H. Hua, Note on Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem., 59 (2008), 373–380. ⇒219Search in Google Scholar

[24] B. Zhou, I. Gutman, On Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem., 57 (2007), 211–220. ⇒219Search in Google Scholar

eISSN:
2066-7760
Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Computer Sciences, other