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 eccentric complexity of a graph G is defined to be the number of different eccentricities of its vertices. Hua et al. (2020) mentioned two open problems and a conjecture on the Merrifield–Simmons index and eccentric complexity of graph. In this paper we solve both open problems and a conjecture. Moreover, we generalize some of the results.
Original language | English |
---|---|
Pages (from-to) | 211-217 |
Number of pages | 7 |
Journal | Discrete Applied Mathematics |
Volume | 288 |
DOIs | |
State | Published - 15 Jan 2021 |
Bibliographical note
Publisher Copyright:© 2020 Elsevier B.V.
Keywords
- Diameter
- Eccentric complexity
- Graph
- Independence number
- Merrifield–Simmons index
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics