The Minimum Merrifield–Simmons Index of Unicyclic Graphs with Diameter at Most Four
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.
2011 ◽
Vol 03
(03)
◽
pp. 323-336
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol 04
(03)
◽
pp. 1250031
◽
Keyword(s):
2008 ◽
Vol Vol. 10 no. 1
(Graph and Algorithms)
◽
2016 ◽
Vol 510
◽
pp. 192-204
◽
2008 ◽
Vol Vol. 10 no. 1
(Graph and Algorithms)
◽