Skip to main content
Log in

The (n,n)-graphs with the first three extremal Wiener indices

  • Published:
Journal of Mathematical Chemistry Aims and scope Submit manuscript

Let G  =  (V, E) be a simple connected graph with vertex set V and edge set E. The Wiener index W(G) of G is the sum of distances between all pairs of vertices in G, i.e., \(W(G)=\sum_{\{u,v\}\subseteq{G}}^{\ }d_{G}(u,v)\), where d G (u, v) is the distance between vertices u and v in G. In this paper, we first give a new formula for calculating the Wiener index of an (n,n)-graph according its structure, and then characterize the (n,n)-graphs with the first three smallest and largest Wiener indices by this formula.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Wiener H. (1947) Structural determination of paraffin boiling points. J. Amer. Chen. Soc. 69: 17–20

    Article  CAS  Google Scholar 

  2. Hosoya H. (1971) Topological index. a newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bull. Chem. Soc. Jpn. 4: 2332–2339

    Article  Google Scholar 

  3. Gutman I., Yeh Y.N., Lee S.L., Luo Y.L. (1993) Some recent results in the theory of the Wiener number. Indian J. Chem. 32A: 651–661

    Google Scholar 

  4. Gutman I., Potgieter J.H. (1997) Wiener index and intermolecular forces. J. Serb. Chem. Soc. 62: 185–192

    CAS  Google Scholar 

  5. Nikolić S., Trinajstić N., Mihalić Z. (1995) The Wiener index: developments and applications. Groat. Chem. Acta 68: 105–129

    Google Scholar 

  6. Dobrymin A.A., Gutman I., Klavžar S., žigert P. (2002) Wiener Index of Hexagonal Systems. Acta Appl. Math. 72: 247–294

    Article  Google Scholar 

  7. Dobrymin A.A., Entriger R., Gutman I. (2001) Wiener index of trees: theory and applications. Acta Appl. Math. 66: 211–249

    Article  Google Scholar 

  8. Fischermann M., Gutman I., Haffman A., Rautenbach D., Vidović D., Volkman L. (2002) Extemal Chemical trees. Z. Naturforsch. 57a: 49–52

    Google Scholar 

  9. H. Deng, The trees on n ≥  9 vertices with the first to seventeenth largest Wiener indices are chemical trees, accepted by MATCH Comm. Math. Comput. Chem. (2006).

  10. Guo X., Dong H. (2005) Ordering trees by their Wiener indices. J. Xiamen Univ. (Nat. Sci.) 44: 297–298

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hanyuan Deng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, Z., Deng, H. The (n,n)-graphs with the first three extremal Wiener indices. J Math Chem 43, 60–74 (2008). https://doi.org/10.1007/s10910-006-9179-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10910-006-9179-5

Keywords

Navigation