Results 231 to 240 of about 14,490,419 (262)

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 ...
Zhibin Du, Bo Zhou, Nenad Trinajstić
exaly   +2 more sources

Relations between the general sum connectivity index and the line graph

Journal of Mathematical Chemistry, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Domingo de Guzman Pestana, José M Sigarreta, W Carballosa   +2 more
exaly   +3 more sources

Atom-bond sum-connectivity index [PDF]

Journal of Mathematical Chemistry, 2022
Akbar Ali is partially supported by Scientific Research Deanship, University of Ha’il, Saudi Arabia, through Project Numbers RG-22 002 and RG-22 005. Boris Furtula and Izudin Redžepović gratefully acknowledge financial support of the Serbian Ministry of ...
Akbar Ali, Ivan Gutman, Boris Furtula
exaly   +2 more sources

General sum-connectivity index of unicyclic graphs with given maximum degree

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomáš Vetrík
exaly   +3 more sources

RELATION BETWEEN GENERAL RANDIC INDEX AND ´ GENERAL SUM CONNECTIVITY INDEX

South East Asian J. of Mathematics and Mathematical Sciences, 2022
The 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, 2009
We 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 General Sum-Connectivity Index of Trees of Fixed Maximum Degree and Order

Match Communications in Mathematical and in Computer Chemistry, 2022
Summary: The general sum-connectivity index is a molecular descriptor introduced within the field of mathematical chemistry about a decade ago. For an arbitrary real number \(\alpha\), the general sum-connectivity index of a graph \(G\) is denoted \(\chi_{\alpha}(G)\) and is defined as the sum of the numbers \(\left(d(u) + d(v)\right)^{\alpha}\) over ...
Raza, Zahid, Balachandran, Selvaraj, Elumalai, Suresh, Ali, Akbar   +3 more
openaire   +2 more sources

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].
R. Khoeilar, H. Shooshtari
openaire   +2 more sources

On the general sum-connectivity index of tricyclic graphs

Journal of Applied Mathematics and Computing, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Zhongxun, Lu, Hongyan
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