图G的Hosoya指标定义为G的独立边集的总数目。令τn,d表示具有n个顶点,直径至少为d的树集。刻画了图类τn,d中取得第二,第三最小Hosoya指标的树。
The Hosoya index of graph G is defined as the total number of the independent edge sets. Let τn,d denote trees having n vertices and having the diameter with the minimal length as d. The trees with the second and the third minimal Hosoya index of τn,d were characterized.