On the sum-connectivity index
From MaRDI portal
The sum-connectivity index is a recent analogue of the famous Randić index, defined as \(R^+(G)=\sum_{uv\in E(G)}(d_u+d_v)^{-1/2}\), where \(d_u\), \(d_v\) are the degrees of the vertices \(u\) and \(v\) of \(G\). The authors derive sharp lower bounds for the sum-connectivity index of general graphs and of triangle-free graphs, respectively.
Recommendations
Cited in
(24)- On a novel connectivity index
- Further inequalities between vertex-degree-based topological indices
- A relation between a vertex-degree-based topological index and its energy
- Energy of a digraph with respect to a VDB topological index
- Hosoya index of VDB-weighted graphs
- Vertex-degree-based topological indices of oriented trees
- On general sum-connectivity index
- On structure-sensitivity of degree-based topological indices
- Sum-connectivity index of a graph
- Extremal problems for degree-based topological indices
- Randić connectivity and sum-connectivity indices for Capra-designed of cycles
- On the sum-connectivity index of unicyclic graphs with k pendent vertices
- The connectivity index
- On the eigenvalues of general sum-connectivity Laplacian matrix
- Two-tree graphs with minimum sum-connectivity index
- On the sum-connectivity index of trees
- Sharp lower bounds on the sum-connectivity index of quasi-tree graphs
- Some bounds on sum connectivity Banhatti index of graphs
- The harmonic index of two-trees and quasi-tree graphs
- On the Randic and sum-connectivity index of nanotubes
- Sum-Networks From Incidence Structures: Construction and Capacity Analysis
- On sum-connectivity index of bicyclic graphs
- On structure sensitivity and chemical applicability of some novel degree-based topological indices
- Relations between the general sum connectivity index and the line graph
This page was built for publication: On the sum-connectivity index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853233)
