On the geometric–arithmetic index by decompositions-CMMSE

The concept of geometric–arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. There are many papers studying different kinds of indices (as Wiener, hyper–Wiener, detour, hyper–detour, Szeged, edge–Szeged, PI, vertex–PI and eccentric connectivity indices) under particular cases of decompositions. The main aim of this paper is to show that the computation of the geometric-arithmetic index of a graph G is essentially reduced to the computation of the geometric-arithmetic indices of the so-called primary subgraphs obtained by a general decomposition of G. Furthermore, using these results, we obtain formulas for the geometric-arithmetic indices of bridge graphs and other classes of graphs, like bouquet of graphs and circle graphs. These results are applied to the computation of the geometric-arithmetic index of Spiro chain of hexagons, polyphenylenes and polyethene.     

The connective eccentricity index of graphs and its applications to octane isomers and benzenoid hydrocarbons

The connective eccentricity index (CEI) of a graph G is defined as , where ε_G(.) denotes the eccentricity of the corresponding vertex. The CEI obligates an influential ability, which is due to its estimating pharmaceutical properties. In this paper, we first characterize the extremal graphs with respect to the CEI among k-connected graphs (k-connected bipartite graphs) with a given diameter. Then, the sharp upper bound on the CEI of graphs with given connectivity and minimum degree (independence number) is determined. Finally, we calculate the CEI of two sets of molecular graphs: octane isomers and benzenoid hydrocarbons. We compare their CEI with some other distance-based topological indices through their correlations with the chemical properties. The linear model for the CEI is better than or as good as the models corresponding to the other distance-based indices.     

PI indices of pericondensed benzenoid graphs

The Padmakar–Ivan (PI) index is a graph invariant defined as the summation of the sums of n _eu (e|G) and n _ev (e|G) over all the edges e = uv of a connected graph G, i.e., , where n _eu (e|G) is the number of edges of G lying closer to u than to v and n _ev (e|G) is the number of edges of G lying closer to v than to u. An efficient formula for calculating the PI index of a class of pericondensed benzenoid graphs consisting of three rows of hexagonal of various lengths.     

A Method of Computing the PI Index of Benzenoid Hydrocarbons Using Orthogonal Cuts

The Padmakar–Ivan (PI) index of a graph G is defined as PI , where for edge e=(u,v) are the number of edges of G lying closer to u than v, and is the number of edges of G lying closer to v than u and summation goes over all edges of G. The PI index is a Wiener–Szeged-like topological index developed very recently. In this paper, we describe a method of computing PI index of benzenoid hydrocarbons (H) using orthogonal cuts. The method requires the finding of number of edges in the orthogonal cuts in a benzenoid system (H) and the edge number of H – a task significantly simpler than the calculation of PI index directly from its definition. On the eve of 70th anniversary of both Prof. Padmakar V. Khadikar and his wife Mrs. Kusum Khadikar.     

Analytical expressions for topological properties of polycyclic benzenoid networks

Quantitative structure‐activity and structure‐property relationships of complex polycyclic benzenoid networks require expressions for the topological properties of these networks. Structure‐based topological indices of these networks enable prediction of chemical properties and the bioactivities of these compounds through quantitative structure‐activity and structure‐property relationships methods. We consider a number of infinite convex benzenoid networks that include polyacene, parallelogram, trapezium, triangular, bitrapezium, and circumcorone series benzenoid networks. For all such networks, we compute analytical expressions for both vertex‐degree and edge‐based topological indices such as edge‐Wiener, vertex‐edge Wiener, vertex‐Szeged, edge‐Szeged, edge‐vertex Szeged, total‐Szeged, Padmakar‐Ivan, Schultz, Gutman, Randić, generalized Randić, reciprocal Randić, reduced reciprocal Randić, first Zagreb, second Zagreb, reduced second Zagreb, hyper Zagreb, augmented Zagreb, atom‐bond connectivity, harmonic, sum‐connectivity, and geometric‐arithmetic indices. In addition we have obtained expressions for these topological indices for 3 types of parallelogram‐like polycyclic benzenoid networks.     

Partition distance in graphs

If G is a graph and \(\mathcal{P}\) is a partition of V(G), then the partition distance of G is the sum of the distance between all pairs of vertices that lie in the same part of \(\mathcal{P}\). This concept generalizes several metric concepts and is dual to the concept of the colored distance due to Dankelmann, Goddard, and Slater. It is proved that the partition distance of a graph can be obtained from the Wiener index of weighted quotient graphs induced by the transitive closure of the Djokovi?–Winkler relation as well as by any partition coarser than it. It is demonstrated that earlier results follow from the obtained theorems. Applying the main results, upper bounds on the partition distance of trees with prescribed order and radius are proved and corresponding extremal trees characterized.     

Kirchhoff index of linear hexagonal chains

The resistance distance r_ij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices. In this work, according to the decomposition theorem of Laplacian polynomial, we obtain that the Laplacian spectrum of linear hexagonal chain L_n consists of the Laplacian spectrum of path P_2n+1 and eigenvalues of a symmetric tridiagonal matrix of order 2n + 1. By applying the relationship between roots and coefficients of the characteristic polynomial of the above matrix, explicit closed‐form formula for Kirchhoff index of L_n is derived in terms of Laplacian spectrum. To our surprise, the Krichhoff index of L_n is approximately to one half of its Wiener index. Finally, we show that holds for all graphs G in a class of graphs including L_n. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2008     

Mostar indices of carbon nanostructures and circumscribed donut benzenoid systems

On the great success of bond-additive topological indices such as Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a quantitative refinement of the distance nonbalancedness and also a peripherality measure in molecular graphs and networks. In this direction, we introduce other variants of bond-additive indices, such as edge-Mostar and total-Mostar indices. The present article explores a computational technique for Mostar, edge-Mostar, and total-Mostar indices with respect to the strength-weighted parameters. As an application, these techniques are applied to compute the three indices for the family of coronoid and carbon nanocone structures.     

Topological Estimation of Aromatic Stabilities of Polyacenes and Helicenes: Modeling of Resonance Energy and Benzene Character

The distance-based topological indices viz Wiener (W)-, Szeged (Sz)-, Padmakar-Ivan (PI)- and Sadhana (Sd)-indices have been used for estimating aromatic stabilities as well as % benzene character of polyacenes and helicenes. Excellent models are obtained in combined set and there was no need to split the data set into polyacenes and helicenes. The newly introduced Sd index was found the best index among all the four indices used. In bi-parametric modeling with the combination of the Sd index with the PI index yielded excellent results. The results are discussed critically on the basis of variety of statistical parameters.     

The (n,n)-graphs with the first three extremal Wiener indices

Let G = (V, E) be a simple connected graph with vertex set V and edge set E. The Wiener index W(G) of G is the sum of distances between all pairs of vertices in G, i.e., , where d _G (u, v) is the distance between vertices u and v in G. In this paper, we first give a new formula for calculating the Wiener index of an (n,n)-graph according its structure, and then characterize the (n,n)-graphs with the first three smallest and largest Wiener indices by this formula.     

Unicycle graphs with extremal Merrifield–Simmons Index

The Merrifield–Simmons index f(G) of a (molecular) graph G is defined as the number of subsets of the vertex set, in which any two vertices are non-adjacent, i.e., the number of independent-vertex sets of G. By we denote the set of unicycle graphs in which the length of its unique cycle is k. In this paper, we investigate the Merrifield–Simmons index f(G) for an unicycle graph G in . Unicycle graphs with the largest or smallest Merrifield–Simmons index are uniquely determined.     

Global Forcing Number of Benzenoid Graphs

A global forcing set in a simple connected graph G with a perfect matching is any subset S of E(G) such that the restriction of the characteristic function of perfect matchings of G on S is an injection. The number of edges in a global forcing set of the smallest cardinality is called the global forcing number of G. In this paper we prove several results concerning global forcing sets and numbers of benzenoid graphs. In particular, we prove that all catacondensed benzenoids and catafused coronoids with n hexagons have the global forcing number equal to n, and that for pericondensed benzenoids the global forcing number is always strictly smaller than the number of hexagons.     

QSPR modeling: graph connectivity indices versus line graph connectivity indices

Five QSPR models of alkanes were reinvestigated. Properties considered were molecular surface-dependent properties (boiling points and gas chromatographic retention indices) and molecular volume-dependent properties (molar volumes and molar refractions). The vertex- and edge-connectivity indices were used as structural parameters. In each studied case we computed connectivity indices of alkane trees and alkane line graphs and searched for the optimum exponent. Models based on indices with an optimum exponent and on the standard value of the exponent were compared. Thus, for each property we generated six QSPR models (four for alkane trees and two for the corresponding line graphs). In all studied cases QSPR models based on connectivity indices with optimum exponents have better statistical characteristics than the models based on connectivity indices with the standard value of the exponent. The comparison between models based on vertex- and edge-connectivity indices gave in two cases (molar volumes and molar refractions) better models based on edge-connectivity indices and in three cases (boiling points for octanes and nonanes and gas chromatographic retention indices) better models based on vertex-connectivity indices. Thus, it appears that the edge-connectivity index is more appropriate to be used in the structure-molecular volume properties modeling and the vertex-connectivity index in the structure-molecular surface properties modeling. The use of line graphs did not improve the predictive power of the connectivity indices. Only in one case (boiling points of nonanes) a better model was obtained with the use of line graphs.     

Ordering chemical unicyclic graphs by Wiener polarity index

Suppose G is a chemical graph with vertex set V(G). Define D(G) = {{u, v} ⊆ V (G) | d _G (u, v) = 3}, where d _G (u, v) denotes the length of the shortest path between u and v. The Wiener polarity index of G, W _p (G), is defined as the size of D(G). In this article, an ordering of chemical unicyclic graphs of order n with respect to the Wiener polarity index is given.