Skip to main content
Log in

The Zero-divisor Graphs of Posets and an Application to Semigroups

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

Abstract

In this paper, we introduce the notion of a compact graph. We show that a simple graph is a compact graph if and only if G is the zero-divisor graph of a poset, and give a new proof of the main result in Halaš and Jukl (Discrete Math 309:4584–4589, 2009) stating that if G is the zero-divisor graph of a poset, then the chromatic number and the clique number of G coincide under a mild assumption. We observe that the zero-divisor graphs of reduced commutative semigroups (rings) are compact, thus provide a large class of graphs G that could be realized as zero-divisor graphs of posets. In addition, using these results, we give some equivalent descriptions for the zero-divisor graphs of posets and reduced commutative semigroups with 0 respectively.

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. Anderson D.F., Levy J., Shapiro R.: Zero-divisor graphs, von Neumann regular rings, and Boolean algebras. J. Pure Appl. Algebra 180, 221–241 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Anderson D.D., Naseer M.: Beck’s coloring of a commutative ring. J. Algebra 159, 500–514 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Beck I.: Coloring of commutative rings. J. Algebra 116, 208–226 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  4. DeMeyer F.R., DeMeyer L.: Zero-divisor graphs of semigroups. J. Algebra 283, 190–198 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Nimbhorkar S.K., Wasadikhar M.P., Demeyer L.: Coloring of meet-semilattices. ARS Comb. 84, 97–104 (2007)

    Google Scholar 

  6. Dilworth R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161–166 (1950)

    Article  MathSciNet  Google Scholar 

  7. DeMeyer F.R., McKenzie T., Schneider K.: The zero-divisor graph of a commutative semigroup. Semigroup Forum 65, 206–214 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Halaš R.: On extensions of ideals in posets. Discrete Math. 308, 4972–4977 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Halaš R.: Ideals and annihilators in ordered sets. Czech. Math. J. 45, 127–134 (1995)

    MATH  Google Scholar 

  10. Halaš R., Lihová J.: On weakly-cut stable maps. Inf. Sci. 180, 971–983 (2010)

    Article  MATH  Google Scholar 

  11. Halaš R., Jukl M.: On Beck’s coloring of posets. Discrete Math. 309, 4584–4589 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  12. Halaš, R., Länger, H.: The zero-divisor graph of a qoset. Order (2009). doi:10.1007/s11083009-9120-1

  13. van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (2001)

  14. Wu T.S., Lu D.C.: Sub-semigroups of determined by the zero-divisor graph. Discrete Math. 308, 5122–5135 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dancheng Lu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, D., Wu, T. The Zero-divisor Graphs of Posets and an Application to Semigroups. Graphs and Combinatorics 26, 793–804 (2010). https://doi.org/10.1007/s00373-010-0955-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0955-4

Keywords

Navigation