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
- Publisher:
- Springer Netherlands
- Journal:
- Journal of Mathematical Chemistry More from this journal
- Volume:
- 43
- Issue:
- 1
- Pages:
- 75-91
- Publication date:
- 2006-09-10
- DOI:
- EISSN:
-
1572-8897
- ISSN:
-
0259-9791
- Language:
-
English
- Keywords:
- Pubs id:
-
pubs:574319
- UUID:
-
uuid:ac0adf9a-98f2-4969-829b-db5580689702
- Local pid:
-
pubs:574319
- Source identifiers:
-
574319
- Deposit date:
-
2015-11-17
- ARK identifier:
Terms of use
- Copyright holder:
- Springer Science+Business Media, Inc
- Copyright date:
- 2006
- Rights statement:
- © 2006 Springer Science+Business Media, Inc.
If you are the owner of this record, you can report an update to it here: Report update to this record