M. S. Haghighat and A. Dolati and M. Tabari and E. Mohseni
The Extremal Graph with the Largest MerrifieldSimmons Index of (n, n 2)graphs
1339 - 1341
2010
4
9
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/14643
https://publications.waset.org/vol/45
World Academy of Science, Engineering and Technology
The MerrifieldSimmons index of a graph G is defined as the total number of its independent sets. A (n, n 2)graph is a connected simple graph with n vertices and n 2 edges. In this paper we characterize the (n, n2)graph with the largest Merrifield Simmons index. We show that its MerrifieldSimmons index i.e. the upper bound of the MerrifieldSimmons index of the (n, n2)graphs is 9 &times; 2n5 1 for n &ge; 5.
Open Science Index 45, 2010