Results 11 to 20 of about 39,052 (275)
Two-Matchings with Respect to the General Sum-Connectivity Index of Trees
AxiomsA vertex-degree-based topological index φ associates a real number to a graph G which is invariant under graph isomorphism. It is defined in terms of the degrees of the vertices of G and plays an important role in chemical graph theory, especially in ...
Roberto Cruz, Mateo Lopez, Juan Rada
doaj +4 more sources
The sharp bounds on general sum-connectivity index of four operations on graphs [PDF]
Journal of Inequalities and Applications, 2016 The general sum-connectivity index χ α ( G ) $\chi_{\alpha}(G)$ , for a (molecular) graph G, is defined as the sum of the weights ( d G ( a 1 ) + d G ( a 2 ) ) α $(d_{G}(a_{1})+d_{G}(a_{2}))^{\alpha}$ of all a 1 a 2 ∈ E ( G ) $a_{1}a_{2}\in E(G)$ , where
Shehnaz Akhter, Muhammad Imran
doaj +6 more sources
On General Sum-Connectivity Index and Number of Segments of Fixed-Order Chemical Trees
Journal of MathematicsNowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class ...
Muzamil Hanif +4 more
doaj +4 more sources
A note on general sum-connectivity index
Proyecciones (Antofagasta), 2023 For a simple finite graph G, general sum-connectivity index is defined for any real number α as χα(G) = , which generalises both the first Zagreb index and the ordinary sum-connectivity index. In this paper, we present some new bounds for the general sum-connectivity index. We also present relation between general sum-connectivity index and general
Phanjoubam, Chinglensana +2 more
core +4 more sources
On the general sum-connectivity index of connected graphs with given order and girth [PDF]
Electronic Journal of Graph Theory and Applications, 2016 In this paper, we show that in the classof connected graphs $G$ of order $n\geq 3$ having girth at least equal to $k$, $3\leq k\leq n$, the unique graph $G$ having minimum general sum-connectivity index $\chi _{\alpha }(G)$ consists of $C_{k}$ and $n-k ...
Ioan Tomescu
doaj +4 more sources
AxiomsThe field of indices has been explored and advanced by various researchers for different purposes. One purpose is the optimization of indices in various problems. In this work, the general power-sum connectivity index is considered. The general power-sum
Muhammad Yasin Khan +2 more
doaj +3 more sources
Electronic Journal of Graph Theory and Applications, 2023 Among bipartite graphs with given order and matching number/vertex cover number/edge cover number/independence number, among multipartite graphs with given order, and among graphs with given order and chromatic number, we present the graphs having the ...
Tomáš Vetrík
doaj +3 more sources
Exact Formula and Improved Bounds for General Sum-Connectivity Index of Graph-Operations
IEEE Access, 2019 For a molecular graph Γ, the general sum-connectivity index is defined as χβ(Γ) = Σvw∈E(Γ)[dΓ(v) + dΓ(w)]β, where β ∈ R and dΓ(v) denotes the degree of the vertex ...
Maqsood Ahmad +3 more
doaj +3 more sources
Computing bounds for the general sum-connectivity index of some graph operations [PDF]
Algebra and Discrete Mathematics, 2020 Summary: Let \(G\) be a graph with vertex set \(V(G)\) and edge set \(E(G)\). Denote by \(d_G(u)\) the degree of a vertex \(u\in V(G)\). The general sum-connectivity index of \(G\) is defined as \(\chi_{\alpha}(G)=\sum_{u_1u_2\in E(G)}(d_G(u_1)+d_G(u_2))^{\alpha}\), where \(\alpha\) is a real number. In this paper, we compute the bounds for general sum-
Akhter, S., Farooq, R.
core +5 more sources
On the general sum-connectivity index of trees with given number of pendent vertices
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Cui, Lingping Zhong
exaly +4 more sources