Abstract
We associate a graph G ∗(P) to a partially ordered set (poset, briefly) with the least element 0, as an undirected graph with vertex set P ∗=P∖{0} and, for two distinct vertices x and y, x is adjacent to y in G ∗(P) if and only if {x,y}ℓ={0}, where, for a subset S of P, S ℓ is the set of all elements x∈P with x≦s for all s∈S. We study some basic properties of G ∗(P). Also, we completely investigate the planarity of G ∗(P).
Similar content being viewed by others
References
D. F. Anderson and P. S. Livingston, The zero-divisor graph of commutative ring, J. Algebra, 217 (1999), 434–447.
I. Beck, Coloring of commutative rings, J. Algebra, 116 (1988), 208–226.
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Elsevier (New York, 1976).
B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press (2002).
F. R. DeMeyer and L. DeMeyer, Zero-divisor graphs of semigroups, J. Algebra, 283 (2005), 190–198.
J. D. LaGrange, Complemented zero-divisor graphs and Boolean rings, J. Algebra, 315 (2007), 600–611.
T. S. Wu, Q. Liu and L. Chen, Zero-divisor semigroups and refinements of a star graph, Discrete Math., 309 (2009), 2510–2518.
Z. Xue and S. Liu, Zero-divisor graphs of partially ordered sets, Appl. Math. Lett., 23 (2010), 449–452.
Author information
Authors and Affiliations
Corresponding author
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Afkhami, M., Barati, Z. & Khashyarmanesh, K. Planar zero divisor graphs of partially ordered sets. Acta Math Hung 137, 27–35 (2012). https://doi.org/10.1007/s10474-012-0231-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-012-0231-6