No label defined (Q4830152)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2121223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2121223 |
Statements
6 December 2004
0 references
connectivity index
0 references
Randić index
0 references
0.9379405
0 references
0.92710763
0 references
0 references
0.91854346
0 references
0.91757154
0 references
0.9140437
0 references
0.9134443
0 references
0.9064797
0 references
0.90616417
0 references
The Randić index of a graph \(G\) is the sum of terms \([d(u)\,d(v)]^{-1/2}\) over all edges \(uv\) of \(G\), where \(d(u)\) is the degree of the vertex \(u\). The Randić index (also called connectivity index) has applications in chemistry. The author characterizes the connected graph on \(n\) vertices and minimum vertex degree 2, that has minimum Randić index. This is the graph having \(n-2\) vertices of degree 2, and 2 vertices of degree \(n-1\).
0 references