Results 241 to 250 of about 217,223 (279)

On the Maximum Atom-Bond Sum-Connectivity Index of Trees

MATCH – Communications in Mathematical and in Computer Chemistry, 2023
Topological 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, 2013
This 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, Sović, Ivan, Batista, Jadranko, Skala, Karolj, Plavšić, Dejan, Vikić-Topić, Dražen, Bešlo, Drago, Nikolić, Sonja, Trinajstić, Nenad   +8 more
openaire   +3 more sources

Extremum sum-connectivity index of trees and unicyclic graphs

Asian-European Journal of Mathematics, 2022
The 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, Shooshtari, Hajar, Motamedi, Ruhollah   +2 more
openaire   +2 more sources

Cacti with maximal general sum-connectivity index

Journal of Applied Mathematics and Computing, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Minimum general sum-connectivity index of unicyclic graphs

Journal of Mathematical Chemistry, 2010
The general sum-connectivity index of a graph G is defined as X alpha(G) = Sigma edges (d(u) + d(v))(alpha), where d(u) denotes the degree of vertex u in G and a is alpha real number. In this report, we determine the minimum and the second minimum values of the general sum-connectivity indices of n-vertex unicyclic graphs for non-zero alpha >= -1, and ...
Du, Zhibin, Zhou, Bo, Trinajstić, Nenad
openaire   +1 more source

Progress in general sum-connectivity index

2011 International Conference on Electronics, Communications and Control (ICECC), 2011
The 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, 2020
For 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

General sum-connectivity index of unicyclic graphs with given diameter

Discrete Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomáš Vetrík, Selvaraj Balachandran   +3 more
openaire   +2 more sources

Two-tree graphs with minimum sum-connectivity index

Discrete Mathematics, Algorithms and Applications, 2020
The 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

Sharp lower bounds on the sum-connectivity index of trees

Discrete Mathematics, Algorithms and Applications, 2021
The 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. In this paper, some
Alyar, S., Khoeilar, R.
openaire   +1 more source