Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index (Q881585): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.11.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079538859 / rank | |||
Normal rank |
Revision as of 02:12, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index |
scientific article |
Statements
Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index (English)
0 references
30 May 2007
0 references
Let \(G\) be a graph and \(d(v)\) denote the degree of vertex \(v\) in \(G\). Then the zeroth-order general Randić index \({}^0R_\alpha(G)\) of \(G\) is defined as \(\sum_{v\in V(G)}d(v)^\alpha\), where \(\alpha\) is a pertinently chosen real number. For any \(\alpha\), the connected \((n,m)\)-graphs with minimum and maximum \({}^0R_\alpha\) are characterized.
0 references
molecular structure descriptor
0 references
zeroth-order general Randić index
0 references
extremal \((n,m)\)-graph
0 references
degree sequence
0 references