Redefined Zagreb indices of Rhombic, triangular, Hourglass and Jagged-rectangle benzenoid systems
Author
Mohammed, Mohanad A.
Haoer, Raad
Ali, Ashaq
Ahmad, Maqbool
Farahani, Mohammad Reza
Nazeer, Saima
Full text
https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/427510.22199/issn.0717-6279-2020-04-0053
Abstract
In the fields of mathematical chemistry and chemical graph theory, a topological index generally called a connectivity index is a kind of a molecular descriptor that is calculated in perspective of the molecular graph of a chemical compound. Topological indices are numerical parameters of a graph which depict its topology and are graph invariant up to graph isomorphism. Topological indices are used for example in the progression of quantitative structure-activity relationships (QSARs) in which the common activity or distinctive properties of atoms are connected with their molecular structure. There are in excess of 140 topological indices but none of them totally describe the molecular compound completely so there is dependably a space to characterize and register new topological indices. Benzenoid Systems are utilized basically as an intermediate to make different synthetic compounds. In this report we aim to compute redefined Zagreb indices for Zigzag, Rhombic, triangular, Hourglass and Jagged-rectangle Benzenoid systems.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Graceful centers of graceful graphs and universal graceful graphs.
Makadia, H. M.; Karavadiya, H. M.; Kaneria, V. J.. Proyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 305-314 -
Equitable Graph of a Graph
Dharmalingam, Kuppusamy Makandan. Proyecciones. Journal of Mathematics; Vol 31 No 4 (2012); 363-372 -
Irregularity indices for line graph of Dutch windmill graph
Mohammed, Mohanad A.; AL-Mayyahi, Suad Younus A. AL-Mayyahi; Virk, Abaid ur Rehman; Rehman, Hafiz Mutee ur. Proyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 903-918