Results 11 to 20 of about 217,897 (268)
Atom-bond sum-connectivity index
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akbar Ali +3 more
openaire +4 more sources
On the general sum-connectivity index of trees
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 general sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graphs of subdivision graphs of tadpole graphs, wheels and ladders have been reported in the literature.
Harishchandra S. Ramane +2 more
doaj +2 more sources
Linear model based on neighborhood ABS index for graph energy in benzenoid hydrocarbons and maximum index cactus graphs [PDF]
The atom-bond-sum (ABS) connectivity index, developed by integrating the degree information from the atom-bond and sum connectivity indices, has attracted significant attention for its effectiveness in correlating thermodynamic properties of chemical ...
Zheng-Qing Chu +3 more
doaj +2 more sources
On the maximum atom-bond sum-connectivity index of graphs
The atom-bond sum-connectivity (ABS) index of a graph GG with edges e1,…,em{e}_{1},\ldots ,{e}_{m} is the sum of the numbers 1−2(dei+2)−1\sqrt{1-2{\left({d}_{{e}_{i}}+2)}^{-1}} over 1≤i≤m1\le i\le m, where dei{d}_{{e}_{i}} is the number of edges adjacent
Alraqad Tariq +3 more
doaj +4 more sources
In this article, we provide new formulas to compute the reduced reciprocal randić index, Arithmetic geometric1 index, SK index, SK1 index, SK2 index, edge version of the first zagreb index, sum connectivity index, general sum connectivity index, and the ...
Dong Yun Shin +5 more
doaj +1 more source
A note on general sum-connectivity index
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
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs
The sum-connectivity index of a graph G is defined as the sum of weights [Formula: see text] over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively.
A. Jahanbani, S. M. Sheikholeslami
doaj +1 more source
Sharp Lower Bounds of the Sum-Connectivity Index of Unicyclic Graphs
The sum-connectivity index of a graph G is defined as the sum of weights 1/du+dv over all edges uv of G, where du and dv are the degrees of the vertices u and v in graph G, respectively.
Maryam Atapour
doaj +1 more source
General sum-connectivity index of trees with given number of branching vertices [PDF]
In 2015, Borovi\'{c}anin presented trees with the smallest first Zagreb index among trees with given number of vertices and number of branching vertices. The first Zagreb index is obtained from the general sum-connectivity index if $a = 1$.
Tomas Vetrik
doaj +1 more source

