An identity for Randic's connectivity index and its applications

摘要

An identity for the Randic index (connectivity index, #chi#) is deduced, enabling the characterization of graphs with minimal and maximal #chi#-values. This identity, however, requires that #chi# is defined just as Randic did 25 years ago-with the exponent equal to-0.5.