On the zero divisor graphs of -lattices
โ Scribed by Vinayak Joshi; Anagha Khiste
- Book ID
- 113567650
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 246 KB
- Volume
- 312
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let R be a commutative ring and ฮ (R) be its zero-divisor graph. In this paper it is shown that for any finite commutative ring R, the edge chromatic number of ฮ (R) is equal to the maximum degree of ฮ (R), unless ฮ (R) is a complete graph of odd order. In [D.F.
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