###### Redefined Zagreb indices of Some Nano Structures

Zagreb index was also independently defined by Mansour and Song [ 15 ]. Moreover, the generalized version was presented in [ 23 ]. There have been many advances in Wiener index, Szeged index, PI index, and other degree-based or distance-based indices of molecular graphs, while the study of the redefined Zagreb indices of nano structures has been largely limited. Furthermore, nanotube, nanostar, polyomino chain and benzenoid series are critical and widespread molecular structures which have been widely applied in medical science, chemical engineering and

###### Revan and hyper-Revan indices of Octahedral and icosahedral networks

.1021/jacs.5b10666 [2] Y. Liu et al. (2016), Weaving of organic threads into crystalline covalent organic frameworks, Science, 351, 365–369. 10.1126/science.aad4011 Liu Y. 2016 Weaving of organic threads into crystalline covalent organic frameworks Science 351 365 369 10.1126/science.aad4011 [3] B. Zhao, J. H. Gan, H. L. Wu, (2016), Redefined Zagreb indices of Some Nano Structures, Applied Mathematics and Nonlinear Sciences, 1, 291–300. 10.21042/AMNS.2016.1.00024 Zhao B. Gan J.H. Wu H.L. 2016 Redefined Zagreb indices of Some Nano Structures Applied Mathematics and

###### Computing topological indices of the line graphs of Banana tree graph and Firecracker graph

-Whittaker-Kotel’nikov’s Theorem Generalized , MATCH Communications in Mathematical and in Computer Chemistry, 73, No 2, 385-396. Antuña A. Guirao J. L. G. López M. A. 2015 Shannon-Whittaker-Kotel’nikov’s Theorem Generalized MATCH Communications in Mathematical and in Computer Chemistry 73 2 385 396 [3] M. Azari and A. Iranmanesh, (2014), Harary Index of Some Nano-Structures , MATCH Communications in Mathematical and in Computer Chemistry, 71, No 2, (2014), 373-382. Azari M. Iranmanesh A. 2014 Harary Index of Some Nano-Structures MATCH Communications in Mathematical and in Computer Chemistry

###### Degree-based indices computation for special chemical molecular structures using edge dividing method

2 ,···, ν d ) of { G i } i = 1 d $\begin{array}{} \displaystyle \{G_{i}\}_{i=1}^{d} \end{array}$ with respect to the vertices { ν i } i = 1 d $\begin{array}{} \displaystyle \{\nu_{i}\}_{i=1}^{d} \end{array}$ is yielded from the graphs G 1 , G 2 ,···, G d in which the vertices ν i and ν i +1 are connected by an edge for i = 1, 2,·, d − 1. The main result of this section is determining the formulas of some degree based indices for the infinite family of nano structures of bridge graph with G 1 , G 2 ,···, G d (see Figure 4 ). We set G d ( H

###### Convexity result and trees with large Balaban index

, Bounds on the Balaban index of trees, MATCH Commun. Math. Comput. Chem . 63 (2010) 813–818. Sun L. Bounds on the Balaban index of trees MATCH Commun. Math. Comput. Chem 63 2010 813 – 818 [27] R. Todeschini, V. Consonni, Handbook of Molecular Descriptors Wiley CH, Weinheim, 2000. 10.1002/9783527613106 Todeschini R. Consonni V. Handbook of Molecular Descriptors Wiley CH, Weinheim 2000 10.1002/9783527613106 [28] B. Zhao, J. Gan, H. Wu, Redefined Zagreb indices of Some Nano Structures Applied Mathematics and Nonlinear Sciences 2 (2016) 291