Skip to main content
Log in

The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs

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

Abstract

Let G be a graph. The irregularity index of G, denoted by t(G), is the number of distinct values in the degree sequence of G. For any graph G, t(G) ≤ Δ(G), where Δ(G) is the maximum degree. If t(G) = Δ(G), then G is called maximally irregular. In this paper, we give a tight upper bound on the size of maximally irregular graphs, and prove the conjecture proposed in [6] on the size of maximally irregular triangle-free graphs. Extremal graphs are also characterized.

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. Alavi Y., Chartrand G., Chung F.R.K., Erdős P., Graham R.L., Oellermann O.R.: Highly irregular graphs. J. Graph Theory 11, 225–249 (1987)

    Article  Google Scholar 

  2. Bondy J.A., Murty U.S.R.: Graph Theory. Springer, New York (2008)

    Book  MATH  Google Scholar 

  3. Majcher Z., Michael J.: Degree sequence of highly irregular graphs. Discrete Math. 164, 225–236 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Majcher Z., Michael J.: Highly irregular graphs with extreme numbers of edges. Discrete Math. 164, 237–242 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Mukwembi S.: A note on diameter and the degree sequence of a graph. Appl. Math. Lett. 25, 175–178 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Mukwembi, S.: On maximally irregular graphs. Bull. Malays. Math. Sci. Soc. (accepted). http://www.emis.de/journals/BMMSS/accepted_papers.htm

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhao Zhang.

Additional information

This research is supported by NSFC (61222201,11171283) and SRFDP (20126501110001).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, F., Zhang, Z. & Meng, J. The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. Graphs and Combinatorics 30, 699–705 (2014). https://doi.org/10.1007/s00373-013-1304-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-013-1304-1

Keywords

Navigation