Skip to main content
SpringerLink
Log in

Sums of Powers of the Degrees of Graphs with k Cut Edges

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

For a graph G with k cut edges and a real number say α, we consider the sum, denoted by \({R_{\alpha}^{0}(G)}\), of the αth powers of the degrees of the vertices of G. This sum is also called the zeroth-order general Randić index of the (molecular) graph G. We present some sharp bounds on this sum according to α in different intervals.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amic D., Beslo D., Lucic B., Nikolic S., Trinajstic N.: The vertex-connectivity index revisited. J. Chem. Inf. Comput. Sci. 38, 819–822 (1998)

    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.: Graph Theory and its Application. The Macmillan Press, London (1976)

    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. Chen S., Deng H.: Extremal (n, n + 1)-graphs with respected to zeroth-order general Randić index. J. Math. Chem. 429(3), 555–564 (2007)

    Article  MathSciNet  Google Scholar 

  6. Cioäba S.M.: Sums of powers of degrees of a graph. Discret. Math. 306, 1959–1964 (2006)

    Article  Google Scholar 

  7. Das K.C.: Maximizing the sum of the squares of the degrees of a graph. Discret. Math. 285, 57–66 (2004)

    Article  MATH  Google Scholar 

  8. Feng Y., Hu X., Li S.: On the extremal Zagreb indices of graphs with cut edges. Acta Appl. Math. 110, 667–684 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hu Y., Li X., Shi Y., Xu T.: Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index. Discret. Appl. Math. 155(8), 1044–1054 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hu Y., Li X., Shi Y., Xu T., Gutman I.: On molecular graphs with smallest and greatest zeroth-order general Randić index. MATCH Commun. Math. Comput. Chem. 54(2), 425–434 (2005)

    MathSciNet  MATH  Google Scholar 

  11. Hua H., Wang M., Wang H.: On zeroth-order general Randić index of conjugated unicyclic graphs. J. Math. Chem. 43(2), 737–748 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hua H., Deng H.: On unicycle graphs with maximum and minimum zeroth-order general Randić index. J. Math. Chem. 41(2), 173–181 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kardoš F., Šrekovski R.: Cyclic edge-cuts in fullerene graphs. J. Math. Chem. 44(1), 121–132 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kier L.B., Hall L.H.: Molecular connectivity in structure activity analysis. Research Studies Press/Wiley, Chichester/UK (1986)

    Google Scholar 

  15. Kier L.B., Hall L.H.: The nature of structure-activity relationships and their relation to molecular connectivity. Eur. J. Med. Chem. 12, 307–312 (1977)

    Google Scholar 

  16. Lang R., Li X., Zhang S.: Inverse problem for Zagreb index of molecular graphs. Appl. Math. J. Chinese Univ. Ser. A 18, 487–493 (2003) (in Chinese)

    MathSciNet  MATH  Google Scholar 

  17. Li X., Zhao H.: Trees with the first three smallest and largest generalized topological indices. MATCH Commun. Math. Comput. Chem. 50, 57–62 (2004)

    Google Scholar 

  18. Li X., Shi Y.: (n, m)-graphs with maximum zeroth-order general Randić index for α in (−1, 0). MATCH Commun. Math. Comput. Chem. 62(1), 163–170 (2009)

    MathSciNet  MATH  Google Scholar 

  19. Li X., Zheng J.: An unified approach to the extremal trees for different indices. MATCH Commun. Math. Comput. Chem. 51, 195–208 (2005)

    MathSciNet  Google Scholar 

  20. Liu H., Lu M., Tian F.: On the spectral radius of graphs with cut edges. Linear Algebra Appl. 389, 139–145 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Nikiforov V.: The sum of squares of the degrees: Sharp asymptotics. Discret. Math. 307, 3187–3193 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Pavlović L.: Maximal value of the zeroth-order Randić index. Discret. Appl. Math. 127, 615–626 (2003)

    Article  MATH  Google Scholar 

  23. Pavlović L., Lazić M., Aleksić T.: More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index”. Discret. Appl. Math. 157(13), 2938–2944 (2009)

    Article  MATH  Google Scholar 

  24. Peled U., Petreschi R., Sterbini A.: (n, e)-graphs with maximum sum of squares of degrees. J. Graph Theory 31, 283–295 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  25. Pepper R., Henry G., Sexton D.: Cut-edges and the independence number. MATCH Commun. Math. Comput. Chem. 56, 403–408 (2006)

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  27. Wu Y., He S., Shu J.: Largest spectral radius among graphs with k cut edges. J. East China Norm. Univ. Nat. Sci. Ed. 3, 67–74 (2007) (Chinese)

    MathSciNet  Google Scholar 

  28. Zhang B., Zhou B.: On zeroth-order general Randić indices of trees and unicyclic graphs. MATCH Commun. Math. Comput. Chem. 58, 139–146 (2007)

    MathSciNet  MATH  Google Scholar 

  29. Zhang, M.J., Li, S.C.: On the zeroth-order general Randić index. J. Math. Chem. (2010). doi:10.1007/s10910-010-9759-2

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Statistics, Central China Normal University, Wuhan, 430079, People’s Republic of China

    Shuchao Li & Lixia Yan

Authors
  1. Shuchao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lixia Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuchao Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, S., Yan, L. Sums of Powers of the Degrees of Graphs with k Cut Edges. Graphs and Combinatorics 27, 727–740 (2011). https://doi.org/10.1007/s00373-010-0996-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0996-8

Keywords

Mathematics Subject Classification (2000)

Search

Navigation