Results 241 to 250 of about 217,897 (268)
Some of the next articles are maybe not open access.
General sum-connectivity index of unicyclic graphs with given diameter
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monther Rashed Alfuraidan +3 more
openaire +4 more sources
On the general sum-connectivity index of tricyclic graphs
Journal of Applied Mathematics and Computing, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Zhongxun, Lu, Hongyan
openaire +3 more sources
Comparison between the zeroth-order Randić index and the sum-connectivity index
Applied Mathematics and Computation, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Ch., Dehmer, Matthias
openaire +4 more sources
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
On the Maximum Atom-Bond Sum-Connectivity Index of Trees
MATCH – Communications in Mathematical and in Computer Chemistry, 2023Topological indices have been under study since 1947 when H. Wiener proposed a mathematical formula to order the boiling temperatures of isomers of alkanes. Since then, over 3000 similar mathematical formulae have been defined and studied by mathematicians, chemists and by other scientists.
Hu, Yarong, Wang, Fangxia
openaire +1 more source
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
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
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
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].
Khoeilar, R., Shooshtari, H.
openaire +1 more source