| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709726 | Applied Mathematics Letters | 2010 | 4 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 Wn,kWn,k be the set of connected graphs with nn vertices and clique number kk. In this note we characterize the graphs from Wn,kWn,k with extremal (maximal and minimal) Hosoya indices and the ones with extremal (maximal and minimal) Merrifield–Simmons indices, respectively.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Kexiang Xu,