• The Smallest Randić Index for Trees

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Extremal graph; tree; the general Randic index.

    • Abstract


      The general Randic index Rα(G) is the sum of the weight d(u)d(v)α over all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α=0, the first three minimum general Randic indices among trees are determined, and the corresponding extremal trees are characterized.

    • Author Affiliations


      Li Bingjun1 2 Liu Weijun1

      1. Department of Mathematics, Hunan Institute of Humanities, Science and Technology, Loudi City, Hunan 417000, China
      2. College of Mathematics, Central South University, Changsha 410000, China
    • Dates

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.