On the ordering of graphs with respect to their matching numbers
Discrete Applied Mathematics
On acyclic conjugated molecules with minimal energies
Discrete Applied Mathematics
On acyclic systems with minimal Hosoya index
Discrete Applied Mathematics
Graph Theory With Applications
Graph Theory With Applications
Distance spectral radius of trees with given matching number
Discrete Applied Mathematics
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 number of independent sets of unicyclic graphs with given matching number
Discrete Applied Mathematics
On the number of independent subsets in trees with restricted degrees
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.04 |
Let G be a unicyclic n-vertex graph and Z(G) be its Hosoya index, let F"n stand for the nth Fibonacci number. It is proved in this paper that Z(G)@?F"n"+"1+F"n"-"1 with the equality holding if and only if G is isomorphic to C"n, the n-vertex cycle, and that if GC"n then Z(G)@?F"n"+"1+2F"n"-"3 with the equality holding if and only if G=Q"n or D"n, where graph Q"n is obtained by pasting one endpoint of a 3-vertex path to a vertex of C"n"-"2 and D"n is obtained by pasting one endpoint of an (n-3)-vertex path to a vertex of C"4.