Let (P, โค) be a partially ordered set (poset, briefly) with a least element 0 and S โ P. An element x โ P is a lower bound of S if s โฅ x for all s โ S. A simple graph G(P) is associated to each poset P with 0. The vertices of the graph are labeled by the elements of P, and two vertices x, y are conn
Planar zero divisor graphs of partially ordered sets
โ Scribed by Afkhami, M.; Barati, Z.; Khashyarmanesh, K.
- Book ID
- 118794913
- Publisher
- Akadmiai Kiad
- Year
- 2012
- Tongue
- English
- Weight
- 531 KB
- Volume
- 137
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let ฮ (R) be the zero-divisor graph of a commutative ring R. An interesting question was proposed by Anderson, Frazier, Lauve, and Livingston: For which finite commutative rings R is ฮ (R) planar? We give an answer to this question. More precisely, we prove that if R is a local ring with at least 3
A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p