Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9655165 | Discrete Applied Mathematics | 2005 | 19 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Juan Rada, Carlos Uzcátegui,