Abstract
The Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let V n , k be the set of connected n -vertex graphs with connectivity at most k . In this note, we characterize the extremal (maximal and minimal) graphs from V n , k with respect to the Hosoya index and the Merrifield–Simmons index, 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.
