<abstract><p>Recently the exponential Randić index $ {{\rm e}^{\chi}} $ was introduced. The exponential Randić index of a graph $ G $ is defined as the sum of the weights $ {{\rm e}^{{\frac {1}{\sqrt {d \left(u \right) d \left(v \right) }}}}} $ of all edges $ uv $ of $ G $, where $ d(u) $ denotes the degree of a vertex $ u $ in $ G $. In this paper, we give sharp lower and upper bounds on the exponential Randić index of unicyclic graphs.</p></abstract>
Qianqian LiuQiuli LiHeping Zhang
Monther Rashed AlfuraidanKinkar Chandra DasTomáš VetríkSelvaraj Balachandran
T. Dehghan-ZadehАли Реза АшрафиNader Habibi