A (n, n + 1)-graph G is a connected simple graph with n vertices and n + 1 edges. In this paper, we determine the upper bound for the Merrifield–Simmons index in (n, n + 1)–graphs in terms of the order n, and characterize the (n, n + 1)–graph with the largest Merrifield–Simmons index.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Merrifield R.E., Simmons H.E. (1980) Theor. Chim. Acta 55: 55–75
Merrifield R.E., Simmons H.E. (1989). Topological Methods in Chemistry. Wiley, New York
Todeschini R., Consonni V. (2000). Handbook of Molecular Descriptors. Wiley-VCH, Weinheim
Prodinger H., Tichy R.F. (1982) Fibonacci Quart. 20: 16–21
Gutman I. (1990) Coll. Sci. Pap. Fac. Sci. Kragujevac 11: 11–18
Gutman I. (1991) Rev. Roum. Chim. 36: 379–388
Li X. (1996) Aust. J. Comb. 14: 15–20
Wang Y., Li X., Gutman I. (2001) Publ. Inst. Math. (Beograd) 69: 41–50
Li X., Li Z., Wang L. (2003) J. Comput. Biol. 10: 47–55
Zhang L., Tian F. (2003) J. Math. Chem. 34: 111–122
Li X., Zhao H., Gutman I. (2005) Math. Commun. Comput. Chem 54(2): 389–402
Pedersen A.S., Vestergaard P.D. (2005) Discrete Appl. Math. 152: 246–256
Chen S., Deng H., Accepted by J. Math. Chem. (2006).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Deng, H., Chen, S. & Zhang, J. The Merrifield–Simmons index in (n, n + 1)-graphs. J Math Chem 43, 75–91 (2008). https://doi.org/10.1007/s10910-006-9180-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10910-006-9180-z