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.
JAFAR ASADPOUR1,* , RASOUL MOJARAD2, MEHDI ALAEIYAN3
Let G be a molecular graph and e=uv be an edge of G. Define n (e |G) eu to the number of edges of lying closer to u than to v and n ev(e |G) to the number of edges of lying closer to v than to u. Then the edge Szeged index of G, Sz (G) e, is defined as the sum of n (e |G) eu nev (e |G) over all edges of G. In this paper we find the above index for ( ) 4 8 TUC C S nanotori graph using the group of automorphisms of G. This is an efficient method of finding this index especially when the automorphism group of G has a few orbits on E(G)..
Edge Szeged Index, Nanotori, automorphism.
JAFAR ASADPOUR, RASOUL MOJARAD, MEHDI ALAEIYAN, Computing the edge Szeged index of polyhex nanotori by automorphism, Optoelectronics and Advanced Materials - Rapid Communications, 9, 9-10, September-October 2015, pp.1221-1223 (2015).
Submitted at: Oct. 30, 2014
Accepted at: Sept. 9, 2015
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.