Journal article icon

Journal article

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.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Publisher copy:
10.1007/s10910-006-9180-z

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
National Natural Science Foundation of China More from this funder
Scientific Research Fund of Hunan Provincial Education Department More from this funder
Publisher:
Springer Netherlands Publisher's website
Journal:
Journal of Mathematical Chemistry Journal website
Volume:
43
Issue:
1
Pages:
75-91
Publication date:
2008-01-01
DOI:
EISSN:
1572-8897
ISSN:
0259-9791
Source identifiers:
574319
Keywords:
Pubs id:
pubs:574319
UUID:
uuid:ac0adf9a-98f2-4969-829b-db5580689702
Local pid:
pubs:574319
Deposit date:
2015-11-17

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP