A unified approach to extremal trees with respect to geometric-arithmetic, Szeged and edge Szeged indices (Q2867538)
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: A unified approach to extremal trees with respect to geometric-arithmetic, Szeged and edge Szeged indices |
scientific article; zbMATH DE number 6241254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified approach to extremal trees with respect to geometric-arithmetic, Szeged and edge Szeged indices |
scientific article; zbMATH DE number 6241254 |
Statements
19 December 2013
0 references
geometric-arithmetic indices
0 references
A unified approach to extremal trees with respect to geometric-arithmetic, Szeged and edge Szeged indices (English)
0 references
The authors provide a unified approach to characterize the tree with the minimum and maximum indices, including the second and third geometric-arithmetic indices, Szeged and edge Szeged indices, among the set of trees with given order and pendent vertices. As a consequence, the path with \(n\) vertices has the maximum second and third geometric-arithmetic indices, as well as maximum Szeged and edge Szeged indices.
0 references
0.8303942084312439
0 references
0.8217725157737732
0 references
0.8171473741531372
0 references
0.7984967231750488
0 references
