The minimum Merrifield-Simmons index of unicyclic graphs with diameter at most four (Q2034522)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minimum Merrifield-Simmons index of unicyclic graphs with diameter at most four |
scientific article; zbMATH DE number 7361869
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum Merrifield-Simmons index of unicyclic graphs with diameter at most four |
scientific article; zbMATH DE number 7361869 |
Statements
The minimum Merrifield-Simmons index of unicyclic graphs with diameter at most four (English)
0 references
22 June 2021
0 references
Summary: The Merrifield-Simmons index \(i(G)\) of a graph \(G\) is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, i.e., the number of independent vertex sets of \(G\). In this paper, we determine the minimum Merrifield-Simmons index of unicyclic graphs with \(n\) vertices and diameter at most four.
0 references
