Abstract
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this paper, we determine the maximum Hosoya index of unicyclic graphs with n vertices and diameter 3 or 4. Our results somewhat answer a question proposed by Wagner and Gutman in 2010 for unicyclic graphs with small diameter.
Originalsprache | Englisch |
---|---|
Aufsatznummer | 1034 |
Fachzeitschrift | Symmetry |
Jahrgang | 11 |
Ausgabenummer | 8 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2019 |