Abstract
The total number of independent subsets, including the empty set, of a graph, is also termed as the Merrifield–Simmons index (MSI) in mathematical chemistry. The connective eccentricity index (CEI), the multiplicative Wiener index (MWI), and the Wiener polarity index (WPI) are all distance-based topological indices. Some of these topological indices found applications in chemistry. The eccentric complexity of a graph G is defined to be the number of different eccentricities of its vertices. In this paper, we first investigate the relationship between MSI and three other distance-based topological indices (CEI, MWI, WPI). We prove that MSI>WPI for any tree, MSI>CEI for any connected bipartite graph, and MWI>MSI for connected graphs with given restricted condition on size. Then we consider extremal problems of MSI on graphs with small eccentric complexity. Moreover, we prove an inequality relating MSI, independence number and eccentric complexity for some special graph families. Finally, some further problems and conjectures are proposed.
Sign-in/Register to access full text options 
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.
