Skip to main content
Log in

The extremal irregularity of connected graphs with given number of pendant vertices

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

The irregularity of a graph G = (V, E) is defined as the sum of imbalances ∣dudv∣ over all edges uvE, where du denotes the degree of the vertex u in G. This graph invariant, introduced by Albertson in 1997, is a measure of the defect of regularity of a graph. In this paper, we completely determine the extremal values of the irregularity of connected graphs with n vertices and p pendant vertices (1 ⩽ pn − 1), and characterize the corresponding extremal graphs.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. H. Abdo, N. Cohen, D. Dimitrov: Graphs with maximal irregularity. Filomat 28 (2014), 1315–1322.

    Article  MathSciNet  Google Scholar 

  2. H. Abdo, D. Dimitrov: The irregularity of graphs under graph operations. Discuss. Math., Graph Theory 34 (2014), 263–278.

    Article  MathSciNet  Google Scholar 

  3. M. O. Albertson: The irregularity of a graph. Ars Comb. 46 (1997), 219–225.

    MathSciNet  MATH  Google Scholar 

  4. M. O. Albertson, D. M. Berman: Ramsey graphs without repeated degrees. Proceedings of the Twenty-Second Southeastern Conference on Combinatorics, Graph Theory, and Computing. Congressus Numerantium 83. Utilitas Mathematica Publishing, Winnipeg, 1991, pp. 91–96.

    Google Scholar 

  5. X. Chen, Y. Hou, F. Lin: Some new spectral bounds for graph irregularity. Appl. Math. Comput. 320 (2018), 331–340.

    MathSciNet  MATH  Google Scholar 

  6. D. Dimitrov, T. Réti: Graphs with equal irregularity indices. Acta Polytech. Hung. 11 (2014), 41–57.

    Google Scholar 

  7. D. Dimitrov, R. Škrekovski: Comparing the irregularity and the total irregularity of graphs. Ars Math. Contemp. 9 (2015), 45–50.

    Article  MathSciNet  Google Scholar 

  8. G. H. Fath-Tabar: Old and new Zagreb indices of graphs. MATCH Commun. Math. Comput. Chem. 65 (2011), 79–84.

    MathSciNet  MATH  Google Scholar 

  9. F. Goldberg: A spectral bound for graph irregularity. Czech. Math. J. 65 (2015), 375–379.

    Article  MathSciNet  Google Scholar 

  10. I. Gutman: Irregularity of molecular graphs. Kragujevac J. Sci. 38 (2016), 71–81.

    Article  Google Scholar 

  11. I. Gutman, P. Hansen, H. Mélot: Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees. J. Chem. Inf. Model. 45 (2005), 222–230.

    MATH  Google Scholar 

  12. P. Hansen, H. Mélot: Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph. Graphs and Discovery. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 69. AMS, Providence, 2005, pp. 253–264.

    MATH  Google Scholar 

  13. M. A. Henning, D. Rautenbach: On the irregularity of bipartite graphs. Discrete Math. 307 (2007), 1467–1472.

    Article  MathSciNet  Google Scholar 

  14. Y. Liu, J. Li: On the irregularity of cacti. Ars Comb. 143 (2019), 77–89.

    MathSciNet  MATH  Google Scholar 

  15. W. Luo, B. Zhou: On the irregularity of trees and unicyclic graphs with given matching number. Util. Math. 83 (2010), 141–147.

    MathSciNet  MATH  Google Scholar 

  16. R. Nasiri, G. H. Fath-Tabar: The second minimum of the irregularity of graphs. Extended Abstracts of the 5th Conference on Algebraic Combinatorics and Graph Theory (FCC). Electronic Notes in Discrete Mathematics 45. Elsevier, Amsterdam, 2014, pp. 133–140.

    MATH  Google Scholar 

  17. D. Rautenbach, L. Volkmann: How local irregularity gets global in a graph. J. Graph Theory 41 (2002), 18–23.

    Article  MathSciNet  Google Scholar 

  18. T. Réti: On some properties of graph irregularity indices with a particular regard to the σ-index. Appl. Math. Comput. 344-345 (2019), 107–115.

    MathSciNet  MATH  Google Scholar 

  19. T. Réti, R. Sharafdini, Á. Drégelyi-Kiss, H. Haghbin: Graph irregularity indices used as molecular descriptors in QSPR studies. MATCH Commun. Math. Comput. Chem. 79 (2018), 509–524.

    MathSciNet  MATH  Google Scholar 

  20. M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman: Extremely irregular graphs. Kragujevac J. Math. 37 (2013), 135–139.

    MathSciNet  MATH  Google Scholar 

  21. D. Vukičević, M. Gašperov: Bond additive modeling 1. Adriatic indices. Croat. Chem. Acta 83 (2010), 243–260.

    Google Scholar 

  22. B. Zhou, W. Luo: On irregularity of graphs. Ars Comb. 88 (2008), 55–64.

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are very grateful to the anonymous referees for their valuable comments and suggestions, which have contributed to the final preparation of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaodan Chen.

Additional information

This work was supported by the National Natural Science Foundation of China (No. 11861011) and by the special foundation for Guangxi Ba Gui Scholars.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, X., Chen, X., Hu, J. et al. The extremal irregularity of connected graphs with given number of pendant vertices. Czech Math J 72, 735–746 (2022). https://doi.org/10.21136/CMJ.2022.0125-21

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.21136/CMJ.2022.0125-21

Keywords

MSC 2020

Navigation