On the Wiener index of unicyclic graphs

Yayın Aralığı: Yılda 6 Sayı
Başlangıç: 2002
Yayıncı: Hacettepe Üniversitesi Fen Fakultesi

The Wiener index of a graph G is defined as W(G) = $Sigma _{u,v} d_G (u, v),$ where $ d_G (u, v)$ is the distance between u and v in G, and the sum goes over all pairs of vertices. In this paper, we characterize the connected unicyclic graph with minimum Wiener indices among all connected unicyclic graphs of order n and girth g with k pendent vertices.

PDF

___

[1] An, X. and Wu, B. The Wiener index of the kth power of a graph, Appl. Math. Lett. 21, 436–440, 2008.
[2] Balakrishnan, Sridharanb, R.N. and Viswanathan, K. Iyer, Wiener index of graphs with more than one cut-vertex, Appl. Math. Lett. 21, 922–927, 2008.
[3] Bondy, J.A. and Murty, U. S.R. Graph Theory with Applications (Macmillan, London, 1976).
[4] Deng, H. The trees on n $geq$ 9 vertices with the first to seventeenth greatest Wiener indices are chemical trees, MATCH Commun. Math. Comput. Chem. 57, 393–402, 2007.
[5] Dobrynin, A., Entringer, R. and Gutman, I. Wiener index of trees: theory and applications, Acta Appl. Math. 66, 211–249, 2001.
[6] Dobrynin, A., Gutman, I., Klavzar, S. and Zigert, P. Wiener index of hexagonal systems, Acta Appl. Math. 72, 247–294, 2002.
[7] Entringer, R.C. Distance in graphs: Trees, J. Comb. Math. Comb. Comput. 24 (1997) 65-84.
[8] Entringer, R.C., Jackson, D.E. and Snyder, D.A. Distance in graphs, Czech. Math. J. 26, 283–296, 1976.
[9] Liu, H.Q. and Lu, M. A unified approach to extremal cacti for different indices, MATCH Commun. Math. Comput. Chem. 58, 183–194, 2007.
[10] Liu, H.Q. and Pan, X.F. Minimal Wiener index of trees with fixed diameter, MATCH Commun. Math. Comput. Chem. 60, 85–94, 2008.
[11] Tang, Z. and Deng, H. The (n, n)-graphs with the first three extremal Wiener index, J. Math. Chem. 43, 60–74, 2008.
[12] Wiener, H. Structural determination of paraffin boiling point, J. Amer. Chem. Soc. 69, 17–20, 1947.