The first six quasi-trees with greatest Randić index (Q2839691)
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: The first six quasi-trees with greatest Randić index |
scientific article; zbMATH DE number 6187591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The first six quasi-trees with greatest Randić index |
scientific article; zbMATH DE number 6187591 |
Statements
12 July 2013
0 references
Randić index
0 references
quasi-tree
0 references
0 references
0 references
0.86667037
0 references
0.8661884
0 references
The first six quasi-trees with greatest Randić index (English)
0 references
The Randić index of a graph \(G\) is the sum of the weights \((d(u)d(v))^{-1/2}\) of all edges \(uv\) of \(G,\) where \(d(u)\) denotes the degree of the vertex \(u\) in \(G.\) A graph \(G\) is called a quasi-tree if there exists \(v \in V(G)\) such that \(G - v\) is a tree. As the title of the paper indicates, the authors determine the first six quasi-trees (of order \(\geq 6\)) with greatest Randić index.
0 references
