Article ID Journal Published Year Pages File Type
418956 Discrete Applied Mathematics 2008 11 Pages PDF
Abstract

The Randić index of a simple connected graph G   is defined as ∑uv∈E(G)(d(u)d(v))-1/2∑uv∈E(G)(d(u)d(v))-1/2. In this paper, we present a sharp lower bound on the Randić index of cacti with r pendants.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A sharp lower bound of the Randić index of cacti with r pendants
Authors
, , ,