| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1708908 | Applied Mathematics Letters | 2012 | 5 Pages |
Abstract
The Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let Vn,kVn,k be the set of connected nn-vertex graphs with connectivity at most kk. In this note, we characterize the extremal (maximal and minimal) graphs from Vn,kVn,k with respect to the Hosoya index and the Merrifield–Simmons index, respectively.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Kexiang Xu, Jianxi Li, Lingping Zhong,