Results 221 to 230 of about 39,692 (244)
Some of the next articles are maybe not open access.
RELATION BETWEEN GENERAL RANDIC INDEX AND ´ GENERAL SUM CONNECTIVITY INDEX
South East Asian J. of Mathematics and Mathematical Sciences, 2022The general Randi´c index is the sum of weights of (d(u).d(v))k for every edge uv of a molecular graph G. On the other hand general Sum-Connectivity index is the sum of the weights (d(u) + d(v))k for every edge uv of G, where k is a real number and d(u) is the degree of vertex u.
V. S., Shigehalli, Dsouza, Austin Merwin
openaire +2 more sources
On general sum-connectivity index
Journal of Mathematical Chemistry, 2009We report some properties especially lower and upper bounds in terms of other graph invariants for the general sum-connectivity index which generalizes both the ordinary sum-connectivity index and the first Zagreb index. Additionally, we give the Nordhaus-Gaddum-type result for the general sum-connectivity index.
Zhou, Bo, Trinajstić, Nenad
openaire +4 more sources
The sum-connectivity index--an additive variant of the Randic connectivity index.
Current computer-aided drug design, 2013This review discusses structure-property modeling applications of a novel variant of the Randic connectivity index that is called the sum-connectivity index. We compare published one-descriptor quantitative structure-property relationship (QSPR) models obtained with the new sum-connectivity index and with the Randic connectivity index, called here the ...
Lučić, Bono +8 more
openaire +3 more sources
Two-tree graphs with maximum general sum-connectivity index
Discrete Mathematics, Algorithms and Applications, 2020For a simple graph [Formula: see text], the general sum-connectivity index is defined as [Formula: see text], where [Formula: see text] is the degree of the vertex [Formula: see text] and [Formula: see text] is a real number. In this paper, we will obtain sharp upper bounds on the general sum-connectivity index for [Formula: see text].
R. Khoeilar, H. Shooshtari
openaire +1 more source
Two-tree graphs with minimum sum-connectivity index
Discrete Mathematics, Algorithms and Applications, 2020The 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.
openaire +2 more sources
Extremum sum-connectivity index of trees and unicyclic graphs
Asian-European Journal of Mathematics, 2022The 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.
Cancan, Murat +2 more
openaire +2 more sources
A Variant of Atom Bond Sum Connectivity Index
Match Communications in Mathematical and in Computer ChemistrySummary: Topological index is a numerical graph invariant derived from molecular graph. The atom bond sum connectivity index drew a lot of interest from chemical graph theorists in a short period of time. Nowadays, the degree sum of a vertex's first neighbors is recognized as a useful parameter in chemical graph theory. Keeping these two facts in mind,
Yasin H, Mohammed +2 more
openaire +1 more source
Progress in general sum-connectivity index
2011 International Conference on Electronics, Communications and Control (ICECC), 2011The general sum-connectivity index of a graph G is defined as χ a (G) = Σ uv∊E(G) (d u +d v )α, where d u (or d v ) denotes the degree of vertex u (or v) in G, E(G) denotes the edge set of G, and α is a real number. This paper outlines the results up to now on this problem.
openaire +1 more source
2010
In this report, we present a novel variant of the connectivity index that we call the sum-connectivity index. This is the additive version of the connectivity index introduced in 1975 by Milan Randić. Initially the Randić index has been introduced as a structural descriptor called branching index that later became well-known Randić connectivity index ...
Nikolić, Sonja +2 more
openaire
In this report, we present a novel variant of the connectivity index that we call the sum-connectivity index. This is the additive version of the connectivity index introduced in 1975 by Milan Randić. Initially the Randić index has been introduced as a structural descriptor called branching index that later became well-known Randić connectivity index ...
Nikolić, Sonja +2 more
openaire
Bounds for the Atom-Bond Sum-Connectivity Index of Graphs
Match Communications in Mathematical and in Computer ChemistrySummary: The \textit{atom-bond sum-connectivity} \((ABSC)\) index of a graph \(G\) is defined as \(ABSC(G)=\sum\limits_{uv\in E(G)}\sqrt\frac{d_u +d_v -2}{d_u +d_v}\), where \(d_u\) and \(d_v\) represent the degrees of \(u\) and \(v\) in \(G\), respectively.
Hussain, Zaryab +2 more
openaire +1 more source