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

Hanyuan Deng; Shubo Chen; Jie Zhang

doi:10.1007/s10910-006-9180-z

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

Hanyuan Deng, Shubo Chen, Jie Zhang

Research output: Contribution to journal › Article › peer-review

37 Citations (SciVal)

Abstract

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 language	English
Pages (from-to)	75-91
Number of pages	17
Journal	Journal of Mathematical Chemistry
Volume	43
Issue number	1
Early online date	10 Sept 2006
DOIs	https://doi.org/10.1007/s10910-006-9180-z
Publication status	Published - 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).

Funding

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

Keywords

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

ASJC Scopus subject areas

General Chemistry
Applied Mathematics

Access to Document

10.1007/s10910-006-9180-z

Cite this

@article{11c20781170b4829bd9fd16ffbf446de,

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

abstract = "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.",

keywords = "(n, n + 1)-graph, Merrifield-Simmons index",

author = "Hanyuan Deng and Shubo Chen and Jie Zhang",

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).",

year = "2008",

month = jan,

day = "1",

doi = "10.1007/s10910-006-9180-z",

language = "English",

volume = "43",

pages = "75--91",

journal = "Journal of Mathematical Chemistry",

issn = "0259-9791",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

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

AU - Deng, Hanyuan

AU - Chen, Shubo

AU - Zhang, Jie

N1 - 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).

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

KW - (n, n + 1)-graph

KW - Merrifield-Simmons index

UR - https://www.scopus.com/pages/publications/37549021868

U2 - 10.1007/s10910-006-9180-z

DO - 10.1007/s10910-006-9180-z

M3 - Article

AN - SCOPUS:37549021868

SN - 0259-9791

VL - 43

SP - 75

EP - 91

JO - Journal of Mathematical Chemistry

JF - Journal of Mathematical Chemistry

IS - 1

ER -

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

Abstract

Bibliographical note

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this