Results 11 to 20 of about 193,960 (258)

On the general sum-connectivity index of trees

open access: yesApplied Mathematics Letters, 2011
The general sum-connectivity index of a graph G is defined as chi(alpha)(G) = Sigma(uvE(G))(d(u) + d(v))(alpha) where du denotes the degree of vertex u in G, E(G) denotes the edge set of G and alpha is a real number. We determine the maximum value for the general sum-connectivity indices of n-vertex trees and the corresponding extremal trees for alpha <
Du, Zhibin, Zhou, Bo, Trinajstić, Nenad
openaire   +5 more sources

The sharp bounds on general sum-connectivity index of four operations on graphs [PDF]

open access: yesJournal 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   +3 more sources

Exact Formula and Improved Bounds for General Sum-Connectivity Index of Graph-Operations

open access: yesIEEE 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   +2 more sources

On the general sum-connectivity index of connected graphs with given order and girth [PDF]

open access: yesElectronic 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   +2 more sources

2-Connected graphs with minimum general sum-connectivity index

open access: yesDiscrete Applied Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioan Tomescu
openaire   +4 more sources

Two-Matchings with Respect to the General Sum-Connectivity Index of Trees

open access: yesAxioms
A 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   +2 more sources

On the general sum-connectivity index of trees with given number of pendent vertices

open access: yesDiscrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cui, Qing, Zhong, Lingping
openaire   +4 more sources

On General Sum-Connectivity Index and Number of Segments of Fixed-Order Chemical Trees

open access: yesJournal of Mathematics
Nowadays, 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   +2 more sources

A note on general sum-connectivity index

open access: yesProyecciones (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
openaire   +2 more sources

On the general atom-bond sum-connectivity index

open access: yesAIMS Mathematics, 2023
<abstract><p>This paper is concerned with a generalization of the atom-bond sum-connectivity (ABS) index, devised recently in [A. Ali, B. Furtula, I. Redžepović, I. Gutman, Atom-bond sum-connectivity index, <italic>J. Math. Chem.</italic>, <bold>60</bold> (2022), 2081-2093].
Abeer M. Albalahi, Zhibin Du, Akbar Ali
openaire   +2 more sources

Home - About - Disclaimer - Privacy