On the sum-connectivity index (Q2853233)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the sum-connectivity index |
scientific article; zbMATH DE number 6217183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sum-connectivity index |
scientific article; zbMATH DE number 6217183 |
Statements
On the sum-connectivity index (English)
0 references
18 October 2013
0 references
Randić index
0 references
triangle-free graph
0 references
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.
0 references
0.882477343082428
0 references
0.8647700548171997
0 references
0.8589299917221069
0 references
0.8566966652870178
0 references
0.8494396209716797
0 references
