Topological properties of Sierpinski network and its application

Background: Sierpinski graphs S(n,k) are largely studied because of their fractal nature with applications in topology, chemistry, mathematics of Tower of Hanoi, and computer sciences. Applications of molecular structure descriptors are a standard procedure that are used to correlate the biological activity of molecules with their chemical structures and thus can be helpful in the field of pharmacology. Objective: The aim of this article is to establish analytically closed computing formulae for eccentricity-based descriptors of Sierpinski networks and their regularizations. These computing formulae are useful to determine a large number of properties like thermodynamic properties, physicochemical properties, chemical and biological activity of chemical graphs. Methods: At first, vertex sets have been partitioned on the basis of their degrees, eccentricities, and frequencies of occurrence. Then these partitions are used to compute the eccentricity-based indices with the aid of some combinatorics. Results: The total eccentric index and eccentric-connectivity index have been computed. We also compute some eccentricity-based Zagreb indices of the Sierpinski networks. Moreover, a comparison has also been presented in the form of graphs. Conclusion: These computations will help the readers to estimate the thermodynamic properties, physicochemical properties of chemical structures, which are of fractal nature and can not be dealt with easily. A 3D graphical representation is also presented to understand the dynamics of the aforementioned topological descriptors.

Ordering graphs with large eccentricity-based topological indices

For a connected graph, the first Zagreb eccentricity index $\xi _{1}$ ξ 1 is defined as the sum of the squares of the eccentricities of all vertices, and the second Zagreb eccentricity index $\xi _{2}$ ξ 2 is defined as the sum of the products of the eccentricities of pairs of adjacent vertices. In this paper, we mainly present a different and universal approach to determine the upper bounds respectively on the Zagreb eccentricity indices of trees, unicyclic graphs and bicyclic graphs, and characterize these corresponding extremal graphs, which extend the ordering results of trees, unicyclic graphs and bicyclic graphs in (Du et al. in Croat. Chem. Acta 85:359–362, 2012; Qi et al. in Discrete Appl. Math. 233:166–174, 2017; Li and Zhang in Appl. Math. Comput. 352:180–187, 2019). Specifically, we determine the n-vertex trees with the i-th largest indices $\xi _{1}$ ξ 1 and $\xi _{2}$ ξ 2 for i up to $\lfloor n/2+1 \rfloor $ ⌊ n / 2 + 1 ⌋ compared with the first three largest results of $\xi _{1}$ ξ 1 and $\xi _{2}$ ξ 2 in (Du et al. in Croat. Chem. Acta 85:359–362, 2012), the n-vertex unicyclic graphs with respectively the i-th and the j-th largest indices $\xi _{1}$ ξ 1 and $\xi _{2}$ ξ 2 for i up to $\lfloor n/2-1 \rfloor $ ⌊ n / 2 − 1 ⌋ and j up to $\lfloor 2n/5+1 \rfloor $ ⌊ 2 n / 5 + 1 ⌋ compared with respectively the first two and the first three largest results of $\xi _{1}$ ξ 1 and $\xi _{2}$ ξ 2 in (Qi et al. in Discrete Appl. Math. 233:166–174, 2017), and the n-vertex bicyclic graphs with respectively the i-th and the j-th largest indices $\xi _{1}$ ξ 1 and $\xi _{2}$ ξ 2 for i up to $\lfloor n/2-2\rfloor $ ⌊ n / 2 − 2 ⌋ and j up to $\lfloor 2n/15+1\rfloor $ ⌊ 2 n / 15 + 1 ⌋ compared with the first two largest results of $\xi _{2}$ ξ 2 in (Li and Zhang in Appl. Math. Comput. 352:180–187, 2019), where $n\ge 6$ n ≥ 6 . More importantly, we propose two kinds of index functions for the eccentricity-based topological indices, which can yield more general extremal results simultaneously for some classes of indices. As applications, we obtain and extend some ordering results about the average eccentricity of bicyclic graphs, and the eccentric connectivity index of trees, unicyclic graphs and bicyclic graphs.

On the eccentric connectivity coindex in graphs

<abstract><p>The well-studied eccentric connectivity index directly consider the contribution of all edges in a graph. By considering the total eccentricity sum of all non-adjacent vertex, Hua et al. proposed a new topological index, namely, eccentric connectivity coindex of a connected graph. The eccentric connectivity coindex of a connected graph $ G $ is defined as</p> <p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ \overline{\xi}^{c}(G) = \sum\limits_{uv\notin E(G)} (\varepsilon_{G}(u)+\varepsilon_{G}(v)). $\end{document} </tex-math></disp-formula></p> <p>Where $ \varepsilon_{G}(u) $ (resp. $ \varepsilon_{G}(v) $) is the eccentricity of the vertex $ u $ (resp. $ v $). In this paper, some extremal problems on the $ \overline{\xi}^{c} $ of graphs with given parameters are considered. We present the sharp lower bounds on $ \overline{\xi}^{c} $ for general connecteds graphs. We determine the smallest eccentric connectivity coindex of cacti of given order and cycles. Also, we characterize the graph with minimum and maximum eccentric connectivity coindex among all the trees with given order and diameter. Additionally, we determine the smallest eccentric connectivity coindex of unicyclic graphs with given order and diameter and the corresponding extremal graph is characterized as well.</p></abstract>

Network Similarity Measure and Ediz Eccentric Connectivity Index

Network similarity measures have proven essential in the field of network analysis. Also, topological indices have been used to quantify the topology of networks and have been well studied. In this paper, we employ a new topological index which we call the Ediz eccentric connectivity index. We use this quantity to define network similarity measures as well. First, we determine the extremal value of the Ediz eccentric connectivity index on some network classes. Second, we compare the network similarity measure based on the Ediz eccentric connectivity index with other well-known topological indices such as Wiener index, graph energy, Randić index, the largest eigenvalue, the largest Laplacian eigenvalue, and connectivity eccentric index. Numerical results underpin the usefulness of the chosen measures. They show that our new measure outperforms all others, except the one based on Wiener index. This means that the measure based on Wiener index is still the best, but the new one has certain advantage to some extent.

Eccentric topological properties of a graph associated to a finite dimensional vector space

A topological index is actually designed by transforming a chemical structure into a number. Topological index is a graph invariant which characterizes the topology of the graph and remains invariant under graph automorphism. Eccentricity based topological indices are of great importance and play a vital role in chemical graph theory. In this article, we consider a graph (non-zero component graph) associated to a finite dimensional vector space over a finite filed in the context of the following eleven eccentricity based topological indices: total eccentricity index; average eccentricity index; eccentric connectivity index; eccentric distance sum index; adjacent distance sum index; connective eccentricity index; geometric arithmetic index; atom bond connectivity index; and three versions of Zagreb indices. Relationship of the investigated indices and their dependency with respect to the involved parameters are also visualized by evaluating them numerically and by plotting their results.