| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 469749 | Computers & Mathematics with Applications | 2008 | 8 Pages |
Abstract
The Hosoya index of a graph is defined as the total number of its matchings. In this paper, we obtain that the largest Hosoya index of (n,n+1)(n,n+1)-graphs is f(n+1)+f(n−1)+2f(n−3)f(n+1)+f(n−1)+2f(n−3), where f(n)f(n) is the nnth Fibonacci number, and we characterize the extremal graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Hanyuan Deng,