Abstract
Let G = (V,E), V = {v1, v2,..., vn}, be a simple connected graph of order n, size m with vertex degree sequence ∆ = d1 ≥ d2 ≥ ··· ≥ dn = d > 0, di = d(vi). Denote by G a complement of G. If vertices vi and v j are adjacent in G, we write i ~ j, otherwise we write i j. The general zeroth-order Randic coindex of ' G is defined as 0Ra(G) = ∑i j (d a-1 i + d a-1 j ) = ∑ n i=1 (n-1-di)d a-1 i , where a is an arbitrary real number. Similarly, general zerothorder Randic coindex of ' G is defined as 0Ra(G) = ∑ n i=1 di(n-1-di) a-1 . New lower bounds for 0Ra(G) and 0Ra(G) are obtained. A case when G has a tree structure is also covered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have