Abstract
For any graph G, let m (G) and i (G) be the numbers of matchings (i.e., the Hosoya index) and the number of independent sets (i.e., the Merrifield-Simmons index) of G, respectively. In this paper, we show that the linear hexagonal spider and zig-zag hexagonal spider attain the extremal values of Hosoya index and Merrifield-Simmons index, respectively.
Original language | English |
---|---|
Pages (from-to) | 2978-2985 |
Number of pages | 8 |
Journal | Discrete Applied Mathematics |
Volume | 156 |
Issue number | 15 |
DOIs | |
Publication status | Published - 6 Aug 2008 |
User-Defined Keywords
- Hexagonal spider
- Hosoya index
- Merrifield-Simmons index