Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647193 | Discrete Mathematics | 2014 | 11 Pages |
Abstract
For a graph GG, the Hosoya index and the Merrifield–Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we characterize the structure of those graphs that minimize the Merrifield–Simmons index and those that maximize the Hosoya index in two classes of simple connected graphs with nn vertices: graphs with fixed matching number and graphs with fixed connectivity.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zhongxun Zhu, Cao Yuan, Eric Ould Dadah Andriantiana, Stephan Wagner,