Skip to main content
SpringerLink
Log in

The Smallest Randić Index for Trees

  • Conference paper
Book cover Web Information Systems and Mining (WISM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7529))

Included in the following conference series:

  • 2676 Accesses

Abstract

The general Randić 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 Randić indices among trees are determined, and the corresponding extremal trees are characterized.

A Project Supported by Scientific Research Fund of Hunan Provincial Education Department and Central South University Postdoctoral Science Foundation Research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balaban, A.T., Motoc, I., Bonchev, D., Mekenyan, O.: Topological indices for structure-activity correlations. Topics Curr. Chem. 114, 21–55 (1983)

    Article  Google Scholar 

  2. Bollobás, B., Erdös, P.: Graphs of extremal weights. Ars Combin. 50, 225–233 (1998)

    MathSciNet  MATH  Google Scholar 

  3. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan Press Ltd., London (1976)

    MATH  Google Scholar 

  4. Caporossi, G., Gutman, I., Hansen, P., Pavlović, L.: Graphs with maximum connectivity index. Comput. Biol. Chem. 27, 85–90 (2003)

    Article  Google Scholar 

  5. Chang, R., Liu, G.: Trees with second minimum general Randić index for α > 0. J. Appl. Math. Comput. 30, 143–149 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hu, Y., Li, X., Yuan, Y.: Trees with minimum general Randić index. MATCH Commun. Math. Comput. Chem. 52, 119–128 (2004)

    MathSciNet  MATH  Google Scholar 

  7. Liu, H., Lu, M., Tian, F.: On the ordering of trees with the general Randić index of the Nordhaus-Gaddum type. MATCH Commun. Math. Comput. Chem. 55, 419–426 (2006)

    MathSciNet  Google Scholar 

  8. Li, X., Gutman, I.: Mathematical Aspects of Randić-Type Molecular Structure Descriptors. Mathematical Chemistry Monographs No.1, Kragujevac (2006)

    Google Scholar 

  9. Randić, M.: On characterization of molecular branching. J. Amer. Chem. Soc. 97, 6609–6615 (1975)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics, Central South University, Changsha, 410000, China

    Bingjun Li & Weijun Liu

  2. Department of Mathematics, Hunan Institute of Humanities Science and Technology, Loudi city, Hunan, 417000, China

    Bingjun Li & Weijun Liu

Authors
  1. Bingjun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weijun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deaprtment of Business Administration, Caritas Institute of Higher Education, 18 Chui Ling Road, Tseung Kwan O, Hong Kong, China

    Fu Lee Wang

  2. School of Computer and Information Engineering, Shanghai University of Electric Power, 200090, Shanghai, China

    Jingsheng Lei

  3. Department of Computer and Inforamtion Science, University of Macau, Av. Padre Tomás Pereira, Taipa, Macau, China

    Zhiguo Gong

  4. School of Computer, Shanghai University, 200444, Shanghai, China

    Xiangfeng Luo

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, B., Liu, W. (2012). The Smallest Randić Index for Trees. In: Wang, F.L., Lei, J., Gong, Z., Luo, X. (eds) Web Information Systems and Mining. WISM 2012. Lecture Notes in Computer Science, vol 7529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33469-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33469-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33468-9

  • Online ISBN: 978-3-642-33469-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation