جستجوی مقالات مرتبط با کلیدواژه "eccentric connectivity index" در نشریات گروه "شیمی"

‎Let G be a connected graph and S be a k element subset of the vertex set V(G)‎. ‎The Steiner-k distance d_{G}(S) between vertices of S is the minimum size among all connected subgraphs whose vertex set contains S‎. ‎In this paper‎, ‎we have defined the Steiner k-eccentric connectivity index and derived a closed formula for the same in case of some standard graphs‎. ‎Also‎, ‎we have used Steiner 3-eccentric connectivity index to predict values of boiling point of some primary and secondary amines‎, ‎cross sectional area and molar refraction of alcohols‎. ‎For each‎, ‎regression model is developed and statistical analysis is conducted and these have ensured at least 97\% accuracy‎.

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this graph by using the Wiener index. Finally we compute eccentric connectivity index of this graph.

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.

In this paper, we calculate the eccentric connectivity index and the eccentricity sequence of two infinite classes of fullerenes with 50 + 10k and 60 + 12k (k in N) carbon atoms.

In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti. Further, it is shown that the extremal chain hexagonal cacti with respect to the eccentric connectivity index belong to one of the considered types. Some open problems and possible directions of further research are mentioned in the concluding section.