Skip to main content
Log in

Idempotent graphs, weak perfectness, and zero-divisor graphs

  • Foundation, algebraic, and analytical methods in soft computing
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The idempotent graph I(R) of a ring R is a graph with nontrivial idempotents of R as vertices, and two vertices are adjacent in I(R) if and only if their product is zero. In the present paper, we prove that idempotent graphs are weakly perfect. We characterize the rings whose idempotent graphs have connected complements. As an application, the idempotent graph of an abelian Rickart ring R is used to obtain the zero-divisor graph \(\Gamma (R)\) of R.

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.

Fig. 1

Similar content being viewed by others

References

  • Abian A (1970) Direct product decomposition of commutative semisimple rings. Proc Am Math Soc 24:502–507

    MathSciNet  MATH  Google Scholar 

  • Akbari S, Habibi M, Majidinya A, Manaviyat R (2013) On the idempotent graph of a ring. J Algebra Appl 12(6):1350003

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Anderson DF, Badawi A (2012) von Neumann regular and related elements in commutative rings. Algebra Colloq 19(SPL. ISS. 1):1017–1040

  • Anderson DF, LaGrange JD (2014) Abian’s poset and the ordered monoid of annihilator classes in a reduced commutative rings. J Algebra Appl 13:237–262

    Article  MathSciNet  Google Scholar 

  • Anderson DF, LaGrange JD (2012) Commutative Boolean monoids, reduced rings, and the compressed zero-divisor graph. J Pure Appl Algebra 216:1626–1636

    Article  MathSciNet  Google Scholar 

  • Anderson DF, LaGrange JD (2016) Some remarks on the compressed zero-divisor graph. J Algebra 447:297–321

    Article  MathSciNet  Google Scholar 

  • Andeson DF, Levy R, Shapiro J (2003) Zero-divisor graphs, von Neumann regular rings, and Boolean algebras. J Pure Appl Algebra 180:221–241

    Article  MathSciNet  Google Scholar 

  • Anderson DF, Livingston PS (1999) The zero-divisor graph of a commutative ring. J Algebra 217:434–447

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Cvetko-Vah K, Dolzan D (2008) Indecomposability graphs of rings. Bull Aust Math Soc 77:151–159

    Article  MathSciNet  Google Scholar 

  • Dorbidi HR, Manviyat R, Mirwakili S (2016) Some properties of the idempotent graph of a ring. Mediterr J Math 13:1419–1427

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Lu D, Wu T (2010) The zero-divisor graphs of posets and an application to semigroups. Graphs Combin 26:793–804

  • Mulay SB (2002) Cycles and symmetries of zero-divisors. Commun Algebra 30:3533–3558

    Article  MathSciNet  Google Scholar 

  • Patil A (2016) Zero-Divisor Graphs of Rickart *-Rings, Dismantlable Lattices and Related Algebraic Structures, Ph. D. Thesis submitted to SPP University, Pune, India

  • Patil A, Waphare BN (2018) The zero-divisor graph of a ring with involution. J Algebra Appl 17(3):1850050

    Article  MathSciNet  Google Scholar 

  • Patil A, Waphare BN (2017) On the zero-divisor graph of Rickart *-rings. Asian-Eur J Math 10(01):1750015

    Article  MathSciNet  Google Scholar 

  • Redmond SP (2002) The zero-divisor graph of a noncommutative ring. Int J Commu. Rings 1(4):203–211

    MATH  Google Scholar 

  • West DB (2001) Introduction to graph theory, 2nd edn. Prentice-Hall of India, New Delhi

    Google Scholar 

Download references

Acknowledgements

The authors express their deep gratitudes to the anonymous referee for many corrections in several revisions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Avinash Patil.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interest regarding the publishing of this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Patil, A., Momale, P.S. Idempotent graphs, weak perfectness, and zero-divisor graphs. Soft Comput 25, 10083–10088 (2021). https://doi.org/10.1007/s00500-021-05982-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-05982-0

Keywords

Navigation