Abstract
The Hosoya index, denoted by z ( G ) , of a (molecular) graph G is defined as the total number of independent-edge sets of G . Let U n be the set of unicyclic graphs with n vertices. A fully loaded unicyclic graph is a unicyclic graph with the property that there is no vertex with degree less than 3 in its unique cycle. Denote by U n 1 the set of fully loaded unicyclic graphs. In this paper, graphs in U n 1 with minimal, second-minimal and third-minimal Hosoya indices are uniquely determined, respectively.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
