Note
On acyclic systems with minimal Hosoya index

https://doi.org/10.1016/S0166-218X(01)00306-7Get rights and content
Under an Elsevier user license
open archive

Abstract

The Hosoya index of a graph is defined as the total number of independent edge subsets of the graph. In this note, we characterize the trees with a given size of matching and having minimal and second minimal Hosoya index.

Keywords

Topological index
Tree
Matching
Extremal tree

Cited by (0)

This work was supported by the National Natural Science Foundation of China (No. 1991086).