Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900984 | Applied Mathematics and Computation | 2018 | 9 Pages |
Abstract
Let G be a graph with edge set E(G). The RandiÄ and sum-connectivity indices of G are defined as R(G)=âuvâE(G)1degG(u)degG(v) and SCI(G)=âuvâE(G)1degG(u)+degG(v), respectively, where degG(u) denotes the vertex degree of u in G. In this paper, the extremal RandiÄ and sum-connectivity index among all n-vertex chemical trees, nâ¯â¥â¯13, connected chemical unicyclic graphs, nâ¯â¥â¯7, connected chemical bicyclic graphs, nâ¯â¥â¯6 and connected chemical tricyclic graphs, nâ¯â¥â¯8, were presented.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Ali Ghalavand, Ali Reza Ashrafi,