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,* , RASOUL MOJARAD1, JAFAR ASADPOUR1
Let G=(V,E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. For u∈V(G), defined d(u) be degree of vertex u. The eccentricity connectivity polynomial of a molecular graph G is defined as ECP(G,x) = Σ ∈ ( ) deg ( ) ( ) u V G ecc u G u x , where ecc(a) is defined as the length of a maximal path connecting a to another vertex of G. In this paper, we computing this polynomial for linear polycene parallalogram graph of benzenoid by a new method..
Eccentricity connectivity polynomial, Eccentricity index, Polycene parallalogram, Benzenod.
MEHDI ALAEIYAN, RASOUL MOJARAD, JAFAR ASADPOUR, A new method for computing eccentric connectivity polynomial of an infinite family of linear polycene parallelogram benzenod, Optoelectronics and Advanced Materials - Rapid Communications, 5, 7, July 2011, pp.761-763 (2011).
Submitted at: May 3, 2011
Accepted at: July 25, 2011
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.