| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421291 | Discrete Applied Mathematics | 2010 | 8 Pages |
Abstract
The recently introduced atom-bond connectivity (ABCABC) index has been applied up until now to study the stability of alkanes and the strain energy of cycloalkanes. Furtula et al. (2009) [3] obtained extremal ABCABC values for chemical trees, and also, it has been shown that the star K1,n−1K1,n−1, has the maximal ABCABC value of trees. In this paper, we present the lower and upper bounds on ABCABC index of graphs and trees, and characterize graphs for which these bounds are best possible.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Kinkar Ch. Das,