Abstract
The total number of matchings of a graph is defined as its Hosoya index. Conjugated and non-conjugated acyclic graphs that have maximal Hosoya index and short diameter are characterized in this paper, explicit expressions of the Hosoya indices of these extremal graphs are also presented.
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.
