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.
S. ALIKHANI1,* , F. JAFARI1
Let G = (V,E) be a simple graph. A set S V is independent set of G , if no two vertices of S are adjacent. The independence number (G) is the size of a maximum independent set in G . An independent set with cardinality (G) is called a -set of G . The problem of finding a -set is NP-complete. We consider two kind of nanotubes and show that these two nanotubes have the same -sets. Also we consider independence polynomial and obtain recurrence relations for independence polynomial of some polyphenyl hexagonal chains..
Independent set, Maximum independent set, Nanotube, Recurrence relation.
S. ALIKHANI, F. JAFARI, On the independent sets of some nano-structures, Optoelectronics and Advanced Materials - Rapid Communications, 6, 9-10, September-October 2012, pp.911-913 (2012).
Submitted at: Feb. 6, 2012
Accepted at: Sept. 20, 2012
Optoelectronics and Advanced Materials - Rapid Communications
(2023): 0.5 - 2023 Journal Citation Reports (Clarivate Analytics, 2024)
Active accounts were imported to the new platform and assigned a random password by default. In order to access your account you need to access the login page and go through the Lost Password dialog (involves the system sending you an email with instructions) in order to reset your password. This step is necessary as passwords are kept in hashed form and the new platform uses modern hashing algorithms incompatible with the previous ones.