Abstract
We study colorings of quasiordered sets (qosets) with a least element 0. To any qoset Q with 0 we assign a graph (called a zerodivisor graph) whose vertices are labelled by the elements of Q with two vertices x,y adjacent if the only elements lying below x and y are those lying below 0. We prove that for such graphs, the chromatic number and the clique number coincide.
Similar content being viewed by others
References
Anderson, D.D., Naseer, M.: Beck’s coloring of a commutative ring. J. Algebra 159, 500–514 (1993)
Anderson, D.F., Livingstone, P.: The zerodivisor graph of a commutative ring. J. Algebra 217, 434–447 (1999)
Beck, I.: Coloring of commutative rings. J. Algebra 116, 208–226 (1988)
Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups, vol. 1. Math. Surveys # 7, American Mathematical Society, Providence (1961)
Erné, M.: Distributive laws for concept lattices. Algebra Univers. 30, 538–580 (1993)
Ganesan, N.: Properties of rings with a finite number of zerodivisors. Math. Ann. 157, 215–218 (1964)
Grätzer, G.: General Lattice Theory. Birkhäuser, Basel (1998)
Harary, F.: Graph Theory. Narosa, New Delphi (1988)
DeMeyer, F., McKenzie, T., Schneider, K.: The zerodivisor graph of a commutative semigroup. Semigroup Forum 65, 206–214 (2002)
Nimbhokar, S.K., Wasadikhar, M.P., DeMeyer, L.: Coloring of meet-semilattices. Ars Comb. 84, 97–104 (2007)
van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the Research and Development Council of the Czech Government via the project MSM6198959214 and by the project KONTAKT No. 2009/12.
Rights and permissions
About this article
Cite this article
Halaš, R., Länger, H. The Zerodivisor Graph of a Qoset. Order 27, 343–351 (2010). https://doi.org/10.1007/s11083-009-9120-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-009-9120-1