Hostname: page-component-89b8bd64d-7zcd7 Total loading time: 0 Render date: 2026-05-07T04:55:23.991Z Has data issue: false hasContentIssue false
  • English
  • Français

THE ZAGREB INDICES OF RANDOM GRAPHS

Published online by Cambridge University Press:  28 March 2013

Qunqiang Feng ,
Zhishui Hu  and
Chun Su
Qunqiang Feng
Affiliation:
Department of Statistics and Finance, School of Management, University of Science and Technology of China, Hefei 230026, China E-mail: fengqq@ustc.edu.cn; huzs@ustc.edu.cn; suchun@ustc.edu.cn
Zhishui Hu
Affiliation:
Department of Statistics and Finance, School of Management, University of Science and Technology of China, Hefei 230026, China E-mail: fengqq@ustc.edu.cn; huzs@ustc.edu.cn; suchun@ustc.edu.cn
Chun Su
Affiliation:
Department of Statistics and Finance, School of Management, University of Science and Technology of China, Hefei 230026, China E-mail: fengqq@ustc.edu.cn; huzs@ustc.edu.cn; suchun@ustc.edu.cn
Get access Rights & Permissions [Opens in a new window]

Abstract

Several limit laws for the Zagreb indices of the classical Erdös–Rényi random graphs are investigated in this paper. We have obtained the necessary and sufficient condition for the asymptotic normality of the two Zagreb indices (suitably normalized), as well as the explicit values for the means and variances of both the indices. Besides, the limiting joint distribution of the numbers of paths of various lengths is also studied under several conditions.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 27 , Issue 2 , April 2013 , pp. 247 - 260
Copyright
Copyright © Cambridge University Press 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Abdo, H., Dimitrov, D., & Gutman, I. (2012). On the Zagreb indices equality. Discrete Applied Mathematics 160: 1–8.CrossRefGoogle Scholar
2.Bollobás, B. (2001). Random graphs, 2nd Ed. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
3.Feng, Q. & Hu, Z. (2011). On the Zagreb index of random recursive trees. Journal of Applied Probability 48: 1189–1196.CrossRefGoogle Scholar
4.Gutman, I. & Trinajstić, N. (1972). Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons. Chemical Physics Letters 17: 535–538.CrossRefGoogle Scholar
5.Janson, S., Łuczak, T., & Ruciński, A. (2000). Random graphs. New York: Wiley-Interscience.CrossRefGoogle Scholar
6.Mikhailov, V.G. (1991). On a theorem of Janson. Teoriya Veroyatnostei i ee Primeneniya 36, 168–170 (In Russian); an English translation appears in Theory of Probability Application 36: 173–176.Google Scholar
7.Nikiforov, V. (2007). The sum of the squares of degrees: sharp asymptotics. Discrete Mathematics 307, 3187–3193.CrossRefGoogle Scholar
8.Nikolić, S., Kovačević, G., Miličević, A., & Trinajstić, N. (2003). The Zagreb indices 30 years after. Croatica Chemica ACTA 76, 113–124.Google Scholar
9.Peled, U.N., Petreschi, R., & Sterbini, A. (1999). (n, e)-graphs with maximum sum of squares of degrees. Journal of Graph Theory 31, 283–295.3.0.CO;2-H>CrossRefGoogle Scholar