@article{(Open Science Index):https://publications.waset.org/pdf/14643,
	  title     = {The Extremal Graph with the Largest Merrifield-Simmons Index of (n, n + 2)-graphs},
	  author    = {M. S. Haghighat and  A. Dolati and  M. Tabari and  E. Mohseni},
	  country	= {},
	  institution	= {},
	  abstract     = {The Merrifield-Simmons 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, n+2)-graph with the largest Merrifield- Simmons index. We show that its Merrifield-Simmons index i.e. the upper bound of the Merrifield-Simmons index of the (n, n+2)-graphs is 9 × 2n-5 +1 for n ≥ 5.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {4},
	  number    = {9},
	  year      = {2010},
	  pages     = {1339 - 1341},
	  ee        = {https://publications.waset.org/pdf/14643},
	  url   	= {https://publications.waset.org/vol/45},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 45, 2010},
	}