Abstract
A (n, n + 1)-graph G is a connected simple graph with n vertices and n + 1 edges. In this paper, we determine the lower bound for the Hosoya index in (n, n + 1)-graphs in terms of the order n, and characterize the (n, n + 1)-graph with the smallest Hosoya index.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
