General sum-connectivity index of unicyclic graphs with given diameter and girth

Author(s):  
Tomáš Vetrík

Topological indices of graphs have been studied due to their extensive applications in chemistry. We obtain lower bounds on the general sum-connectivity index [Formula: see text] for unicyclic graphs [Formula: see text] of given girth and diameter, and for unicyclic graphs of given diameter, where [Formula: see text]. We present the extremal graphs for all the bounds. Our results generalize previously known results on the harmonic index for unicyclic graphs of given diameter.

2020 ◽  
Vol 2020 ◽  
pp. 1-7 ◽  
Author(s):  
Xuewu Zuo ◽  
Jia-Bao Liu ◽  
Hifza Iqbal ◽  
Kashif Ali ◽  
Syed Tahir Raza Rizvi

Topological indices like generalized Randić index, augmented Zagreb index, geometric arithmetic index, harmonic index, product connectivity index, general sum-connectivity index, and atom-bond connectivity index are employed to calculate the bioactivity of chemicals. In this paper, we define these indices for the line graph of k-subdivided linear [n] Tetracene, fullerene networks, tetracenic nanotori, and carbon nanotube networks.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yunfang Tang ◽  
Xuli Qi

AbstractFor 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.


2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Maryam Atapour

The sum-connectivity index of a graph G is defined as the sum of weights 1 / d u + d v over all edges u v of G , where d u and d v are the degrees of the vertices u and v in graph G , respectively. In this paper, we give a sharp lower bound on the sum-connectivity index unicyclic graphs of order n ≥ 7 and diameter D G ≥ 5 .


2021 ◽  
Vol 7 (1) ◽  
pp. 651-666
Author(s):  
Hongzhuan Wang ◽  
◽  
Xianhao Shi ◽  
Ber-Lin Yu

<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>


2017 ◽  
Vol 2 (1) ◽  
pp. 21-30 ◽  
Author(s):  
B. Basavanagoud ◽  
Veena R. Desai ◽  
Shreekant Patil

AbstractLet Eβ (G) be the set of paths of length β in a graph G. For an integer β ≥ 1 and a real number α, the (β,α)-connectivity index is defined as$$\begin{array}{} \displaystyle ^\beta\chi_\alpha(G)=\sum \limits_{v_1v_2 \cdot \cdot \cdot v_{\beta+1}\in E_\beta(G)}(d_{G}(v_1)d_{G}(v_2)...d_{G}(v_{\beta+1}))^{\alpha}. \end{array}$$The (2,1)-connectivity index shows good correlation with acentric factor of an octane isomers. In this paper, we compute the (2, α)-connectivity index of certain class of graphs, present the upper and lower bounds for (2, α)-connectivity index in terms of number of vertices, number of edges and minimum vertex degree and determine the extremal graphs which achieve the bounds. Further, we compute the (2, α)-connectivity index of line graphs of subdivision graphs of 2D-lattice, nanotube and nanotorus of TUC4C8[p,q], tadpole graphs, wheel graphs and ladder graphs.


Author(s):  
S. Alyar ◽  
R. Khoeilar

The sum-connectivity index of a graph [Formula: see text] is defined as the sum of weights [Formula: see text] over all edges [Formula: see text] of [Formula: see text], where [Formula: see text] and [Formula: see text] are the degrees of the vertices [Formula: see text] and [Formula: see text] in [Formula: see text], respectively. In this paper, some extremal problems on the sum-connectivity index of trees are studied. The extremal values on the sum-connectivity index of trees with given graphic parameters, such as pendant number, matching number, domination number and diameter, are determined. The corresponding extremal graphs are characterized, respectively.


Filomat ◽  
2015 ◽  
Vol 29 (4) ◽  
pp. 673-686 ◽  
Author(s):  
Lingping Zhong ◽  
Qing Cui

The harmonic index of a graph G is defined as the sum of the weights 2/d(u)+d(v) of all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this work, we present the minimum, second-minimum, maximum and second-maximum harmonic indices for unicyclic graphs with given girth, and characterize the corresponding extremal graphs.


2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Tanweer Ul Islam ◽  
Zeeshan Saleem Mufti ◽  
Aqsa Ameen ◽  
Muhammad Nauman Aslam ◽  
Ali Tabraiz

A topological index, also known as connectivity index, is a molecular structure descriptor calculated from a molecular graph of a chemical compound which characterizes its topology. Various topological indices are categorized based on their degree, distance, and spectrum. In this study, we calculated and analyzed the degree-based topological indices such as first general Zagreb index M r G , geometric arithmetic index GA G , harmonic index H G , general version of harmonic index H r G , sum connectivity index λ G , general sum connectivity index λ r G , forgotten topological index F G , and many more for the Robertson apex graph. Additionally, we calculated the newly developed topological indices such as the AG 2 G and Sanskruti index for the Robertson apex graph G.


2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Muhammad Haroon Aftab ◽  
Muhammad Rafaqat ◽  
M. Hussain ◽  
Tariq Zia

In this research paper, we will compute the topological indices (degree based) such as the ordinary generalized geometric-arithmetic (OGA) index, first and second Gourava indices, first and second hyper-Gourava indices, general Randic´ index R γ G , for  γ = ± 1 , ± 1 / 2 , harmonic index, general version of the harmonic index, atom-bond connectivity (ABC) index, SK, SK1, and SK2 indices, sum-connectivity index, general sum-connectivity index, and first general Zagreb and forgotten topological indices for various types of chemical networks such as the subdivided polythiophene network, subdivided hexagonal network, subdivided backbone DNA network, and subdivided honeycomb network. The discussion on the aforementioned networks will give us very remarkable results by using the aforementioned topological indices.


2021 ◽  
Vol 49 (1) ◽  
Author(s):  
Abhay Rajpoot ◽  
◽  
Lavanya Selvaganesh ◽  

Miliˇcevi´c et al., in 2004, introduced topological indices known as Reformulated Zagreb indices, where they modified Zagreb indices using the edge-degree instead of vertex degree. In this paper, we present a simple approach to find the upper and lower bounds of the second reformulated Zagreb index, EM2(G), by using six graph operations/transformations. We prove that these operations significantly alter the value of reformulated Zagreb index. We apply these transformations and identify those graphs with cyclomatic number at most 3, namely trees, unicyclic, bicyclic and tricyclic graphs, which attain the upper and lower bounds of second reformulated Zagreb index for graphs.


Sign in / Sign up

Export Citation Format

Share Document