A linear-programming approach to the generalized Randić index (Q1811120): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:46, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-programming approach to the generalized Randić index |
scientific article |
Statements
A linear-programming approach to the generalized Randić index (English)
0 references
10 June 2003
0 references
The sum of \((d(u)d(v))^\alpha\) over all edges \(uv\) of a graph \(G\) is called the generalized Randić index \(R_\alpha(G)\) of \(G\). The authors obtain results on graphs \(G\) with a minimum value of \(R_\alpha(G)\) among graphs with \(n\) vertices, \(m\) edges, and maximum degree at most \(\Delta\) when \(\alpha= -1/2\) or \(-1\).
0 references
bounded degrees
0 references
