General sum-connectivity index of unicyclic graphs with given diameter and girth
Discrete Mathematics, Algorithms and Applications, 2021Topological indices of graphs have been studied due to their extensive applications in chemistry. We obtain lower bounds on the general sum-connectivity index [Formula: see text] for unicyclic graphs [Formula: see text] of given girth and diameter, and for unicyclic graphs of given diameter, where [Formula: see text].
openaire +2 more sources
On the General Sum–Connectivity Co–Index of Graphs
2011In this paper, a new molecular-structure descriptor, the general sum–connectivity co–index is considered, which generalizes the first Zagreb co–index and the general sum– connectivity index of graph theory. We mainly explore the lower and upper bounds in terms of the order and size for this new invariant.
SU, G., XU, L.
openaire +1 more source
The Minimum General Sum-Connectivity Index of Trees with Given Matching Number
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lingping Zhong, Qiuping Qian
openaire +1 more source
On General Sum-Connectivity Index of Benzenoid Systems and Phenylenes
2010The general sum-connectivity index of a graph G, denoted by ) (G a a χ χ = is defined as ∑ ∈ + = ) ( ) ( G E uv a v u a d d χ , where du (or dv) is the degree of the vertex u (or v). Efficient formulas for calculating the general sum-connectivity index of benzenoid systems and their phenylenes are given, and a relation is established between the ...
CHEN, SH., XIA, F., YANG, J.
openaire +1 more source
Extremal Values of the General Harmonic Index and General Sum-Connectivity Index of f -Benzenoids
Polycyclic Aromatic Compounds, 2020The general harmonic index and general sum-connectivity index are two degree-based topological indices which reflect certain structural features of organic molecules.
Qingfang Ye, Fengwei Li, Ruixuan Ye
openaire +1 more source
General Sum-Connectivity Index with a = 1 for Trees and Unicyclic Graphs with k Pendants
2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2015One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as ?a(G) = Suv?E(G)(d(u)+d(v))a, where d(u) denotes the degree of vertex u in G and a is a real number. The aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for ...
Rozica-Maria Tache, Ioan Tomescu
openaire +1 more source
A Note on the General Sum–Connectivity Index of a Graph and Its Line Graph
Match Communications in Mathematical and in Computer ChemistrySummary: For a real number \(\beta\), the general sum-connectivity index \(\chi_\beta(G)\) of a graph \(G\) is defined as \(\chi_\beta(G) = \sum_{xy\in E(G)}(d_G(x) + d_G(y))^\beta\), where \(d(x)\) denote the degree of a vertex \(x\) in \(G\). In Chen (2023), the author present the lower bounds for \(\chi_\beta(L(G))\) in terms of \(\chi_\beta(G ...
Su, Zhenhua, Tang, Zikai, Chen, Shubo
openaire +2 more sources
On the maximum general sum-connectivity index of trees with a fixed order and maximum degree
Discrete Mathematics, Algorithms and Applications, 2020The general sum-connectivity index of a graph [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text], where [Formula: see text] is the edge connecting the vertices [Formula: see text], [Formula: see text] denotes the degree of the vertex [Formula: see text], and [Formula: see text] is a nonzero real number.
openaire +1 more source
General ( α , 2 ) Path Sum Connectivity Index of Nanostructures
Journal of Corrosion and MaterialsThe general path sum connectivity index of a molecular graph, denoted as t χ α ( G ) , is defined for a graph G , where α is a positive real number and t is a positive integer. This index is expressed as: t χ α ( G ) = ∑ p t = v j 1 v j 2 … v j t + 1 ⊆ G [ d G ( v j 1 ) + d G ( v j 2 ) + ⋯ + d G ( v j t + 1 ) ] α , where p t represents a ...
openaire +1 more source
On trees of a fixed maximum degree with extremal general atom-bond sum-connectivity index
Journal of Applied Mathematics and ComputingWe consider general atom-bond sum-connectivity indices $ABS_l(G)$ for $1/2 \leq l \leq 1$ and study their values over all trees on a given number of vertices with a fixed maximum degree $\Delta $. We obtain both the minimum and the maximum values and characterize the corresponding trees.
Akbar Ali, Tomislav Doslic, Zahid Raza
openaire +2 more sources

