On the Hosoya Indices of Bicyclic Graphs with Small Diameter
Let G be a graph. The Hosoya index of G, denoted by zG, is defined as the total number of its matchings. The computation of zG is NP-Complete. Wagner and Gutman pointed out that it is difficult to obtain results of the maximum Hosoya index among tree-like graphs with given diameter. In this paper, w...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Chemistry |
Online Access: | http://dx.doi.org/10.1155/2021/5555700 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|