Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6420069 | Applied Mathematics and Computation | 2016 | 5 Pages |
Abstract
The zeroth-order RandiÄ index and the sum-connectivity index are very popular topological indices in mathematical chemistry. These two indices are based on vertex degrees of graphs and attracted a lot of attention in recent years. Recently Li and Li (2015) studied these two indices for trees of order n. In this paper we obtain a relation between the zeroth-order RandiÄ index and the sum-connectivity index for graphs. From this we infer an upper bound for the sum-connectivity index of graphs. Moreover, we prove that the zeroth-order RandiÄ index is greater than the sum-connectivity index for trees. Finally, we show that R2,âα(G) is greater or equal R1,âα(G) (α ⥠1) for any graph and characterize the extremal graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Kinkar Ch. Das, Matthias Dehmer,