"

Cookies ussage consent

Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.

On computing Merrifield–Simmons index

M. B. AHMADI1,* , Z. SEIF1

Affiliation

  1. Department of Mathematics, College of Sciences, Shiraz University, Iran

Abstract

The Merrifield–Simmons index, i(G) , of a molecular graph G is important in structural chemistry and defined as the number of subsets of the vertex set, in which any two vertices are non-adjacent, i.e., the number of independent-vertex sets of G . In this paper for calculating Merrifield–Simmons index, we formulate an integer linear programming problem to compute the k-independent set of G and then we solve it by AIMMS software..

Keywords

Merrifield–Simmons index, Molecular graph, AIMMS software, Integer programming.

Citation

M. B. AHMADI, Z. SEIF, On computing Merrifield–Simmons index, Optoelectronics and Advanced Materials - Rapid Communications, 4, 1, January 2010, pp.56-58 (2010).

Submitted at: Nov. 5, 2009

Accepted at: Jan. 19, 2010