Name
Abstract | ||
|---|---|---|
We study the behavior of the Randić index χ subject to the operation on a tree T which creates a new tree T' ≠ T by deleting an edge ax of T and adding a new edge incident to either a or x. Let ≼mso be the smallest poset containing all pairs (T, T') such that χ(T) T') and T, T' ∈ Cn (where Cn is the collection of trees with n vertices and of maximum degree 4). We will determine the maximal and minimal elements of (Cn, ≼mso). We present an algorithm to construct χ-monotone chains of trees T0, T1, T2,...,Tm such that Ti ≺msoTi+1. As a corollary of our results, we present a new method to calculate the first values of χ on Cn. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.dam.2005.02.014 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
smallest poset,maximum degree,minimal element,partial ordering,edge ax,n vertex,trees t0,g subject,new tree,chemical tree,chemical trees,new method,monotone chain,connectivity index,new edge incident,randić index,randic index,indexation,partial order | Journal | 150 |
Issue | ISSN | Citations |
1 | Discrete Applied Mathematics | 3 |
PageRank | References | Authors |
0.49 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Rada | 1 | 36 | 10.02 |
| Carlos Uzcátegui | 2 | 64 | 9.18 |