The Merrifield-Simmons index in (n, n + 1)-graphs

Hanyuan Deng, Shubo Chen, Jie Zhang

Research output: Contribution to journalArticlepeer-review

37 Citations (SciVal)


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.

Original languageEnglish
Pages (from-to)75-91
Number of pages17
JournalJournal of Mathematical Chemistry
Issue number1
Early online date10 Sept 2006
Publication statusPublished - 1 Jan 2008

Bibliographical note

Funding Information:
Project 10471037 supported by National Natural Science Foundation of China and A Project Supported by Scientific Research Fund of Hunan Provincial Education Department(04B047).


  • (n, n + 1)-graph
  • Merrifield-Simmons index

ASJC Scopus subject areas

  • General Chemistry
  • Applied Mathematics


Dive into the research topics of 'The Merrifield-Simmons index in (n, n + 1)-graphs'. Together they form a unique fingerprint.

Cite this