Skip to main content
Log in

Zero-divisor graphs and total coloring conjecture

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In this paper, we prove that the zero-divisor graphs of a special class of pseudocomplemented posets satisfy the total coloring conjecture. Also, we determine the edge chromatic number of the zero-divisor graphs of this special class of pseudocomplemented posets. These results are applied to zero-divisor graphs of finite reduced commutative rings.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Aalipour G, Akbari S, Nikandish R, Nikmehrb MJ, Shaveisi F (2012) On the coloring of the annihilating-ideal graph of a commutative ring. Discret Math 312:2620–2626

    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 

  • Atiyah MF, MacDonald IG (1969) Introduction to commutative algebra. Addison-Wesley, Reading

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Behzad M (1965) Graphs and their chromatic numbers. PhD thesis, Michigan State University, East LanSing

  • Behzad M, Chartrand G, Cooper JK Jr (1967) The colour numbers of complete graphs. J Lond Math Soc 42:226–228

    Article  MathSciNet  Google Scholar 

  • Devhare S, Joshi V, LaGrange JD (2018) On the complement of the zero-divisor graph of partially ordered sets. Bull Aust Math Soc 97:185–193

    Article  MathSciNet  Google Scholar 

  • Devhare S, Joshi V, LaGrange JD (2019) Eulerian and Hamiltonian complements of zero-divisor graphs of pseudo complemented posets. Palest J Math 8(2):30–39

    MathSciNet  MATH  Google Scholar 

  • Galvin F, Komjath P (1991) Graph colorings and the axiom of choice. Period Math Hung 22:71–75

    Article  MathSciNet  Google Scholar 

  • Gupta RP (1967) Studies in the theory of graphs. PhD thesis, Tata Institute of Fundamental Research, Bombay

  • Halaš R (1993) Pseudocomplemented ordered sets. Arch Math (Brno) 29:153–160

    MathSciNet  MATH  Google Scholar 

  • Halaš R, Jukl M (2009) On Beck’s coloring of partially ordered sets. Discret Math 309:4584–4589

    Article  Google Scholar 

  • Jensen TR, Toft B (1995) Graph coloring problems. Wiley-Inter-science series in discrete mathematics and optimization. Wiley-Interscience, New York

    MATH  Google Scholar 

  • Joshi V (2012) Zero divisor graph of a poset with respect to an ideal. Order 29:499–506

    Article  MathSciNet  Google Scholar 

  • Joshi V, Khiste A (2014) The zero-divisor graphs of Boolean posets. Math Slovaca 64:511–519

    Article  MathSciNet  Google Scholar 

  • Joshi V, Pourali HY, Waphare BN (2014) The graph of equivalence classes of zero divisors. ISRN Discret Math 2014:896270

    Article  Google Scholar 

  • Khiste A (2014) Zero-divisor graphs of posets. PhD thesis, University of Pune

  • LaGrange JD, Roy KA (2013) Poset graphs and the lattice of graph annihilators. Discret Math 313(10):1053–1062

    Article  MathSciNet  Google Scholar 

  • Larmerová J, Rachůnek J (1988) Translations of distributive and modular ordered sets. Acta Univ Palacki Olomonc 91:13–23

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Stiebitz M, Scheide D, Toft B, Favrholdt LM (2012) Graph edge coloring: Vizing’s theorem and Goldberg’s conjecture. Wiley series in discrete mathematics and optimization. Wiley, New York

    MATH  Google Scholar 

  • Venkatanarasimhan PV (1971) Pseudo-complements in posets. Proc Am Math Soc 28–1:9–17

    Article  MathSciNet  Google Scholar 

  • Vizing VG (1964) On an estimate of the chromatic class of a p-graph. Metody Diskret Anal 3:25–30 (in Russian)

    MathSciNet  Google Scholar 

  • Vizing VG (1965) The chromatic class of a multigraph. Kibernetika(Kiev) 1(3):29–39 (in Russian). English translation in cybernetics, 1 (1965), 32-41

    MathSciNet  Google Scholar 

  • Yap HP (1986) Some topics in graph theory. In: London mathematical society lecture note series, vol. 108. Cambridge University Press, Cambridge

Download references

Acknowledgements

The authors gratefully acknowledge the financially support by Department of Science and Technology via DST-SERB Project EMR/2016/005162. Also, the authors would like to thank the referee for his/her valuable suggestions which improved the presentation of the paper. The first author would like to dedicate this research work to Late Somnath Narale for his constant support and encouragement.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vinayak Joshi.

Ethics declarations

Conflict of interest

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

Additional information

Communicated by A. Di Nola.

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

Khandekar, N., Joshi, V. Zero-divisor graphs and total coloring conjecture. Soft Comput 24, 18273–18285 (2020). https://doi.org/10.1007/s00500-020-05344-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05344-2

Keywords

Navigation