The largest Hosoya index of (n,n+1)-graphs

Authors:
Hanyuan Deng
Affiliations:
College of Mathematics and Computer Science, Hunan Normal University, Changsha, Hunan 410081, PR China
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 3
Cited 3

On the ordering of graphs with respect to their matching numbers

Discrete Applied Mathematics
On acyclic systems with minimal Hosoya index

Discrete Applied Mathematics
A note on the number of matchings and independent sets in trees

Discrete Applied Mathematics

Trees with minimal Laplacian coefficients

Computers & Mathematics with Applications
Maxima and Minima of the Hosoya Index and the Merrifield-Simmons Index

Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
The smallest Merrifield-Simmons index of (n,n+1)-graphs

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.09

Visualization

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)-graphs is f(n+1)+f(n-1)+2f(n-3), where f(n) is the nth Fibonacci number, and we characterize the extremal graphs.