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.
MEHDI ALAEIYAN1,* , JAFAR ASADPOUR1
Let G=(V,E) be a molecular graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. For uV(G), dfined deg(u) be degree of vertex u, and nG(u) is the sum of the degrees of its neighborhoods. The modified eccentricity connectivity polynomial of a molecular graph G is defined as (G,x)=uV (G)nG(u). xecc(u), where ecc(u) is defined as the length of a maximal path connecting u to another vertex of molecular graph G. In this paper, we computing this polynomial for an infinite family of linear polycene parallelogram P(n,n)..
Modified eccentricity connectivity polynomial, Polycene parallelogram.
MEHDI ALAEIYAN, JAFAR ASADPOUR, Computing the MEC polynomial of an infinite family of the linear parallelogram P(n,n), Optoelectronics and Advanced Materials - Rapid Communications, 6, 1-2, January-February 2012, pp.191-193 (2012).
Submitted at: Aug. 17, 2011
Accepted at: Feb. 20, 2012
Optoelectronics and Advanced Materials - Rapid Communications
(2022): 0.5 - 2022 Journal Citation Reports (Clarivate Analytics, 2023)
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.