The Maximum Hosoya Index of Unicyclic Graphs with Diameter at Most Four
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.
2008 ◽
Vol 48
(5-6)
◽
pp. 940-948
◽
2007 ◽
Vol 43
(2)
◽
pp. 831-844
◽
1967 ◽
Vol 25
◽
pp. 352-353
Keyword(s):
1972 ◽
Vol 30
◽
pp. 34-35
1991 ◽
Vol 49
◽
pp. 466-467
1992 ◽
Vol 50
(2)
◽
pp. 1682-1683