A note on the zero divisor graph of a lattice
Clicks: 277
ID: 46033
2014
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
6.9
/100
23 views
23 readers
Trending
AI Quality Assessment
Not analyzed
Abstract
Let $L$ be a lattice with the least element $0$. An element $xin L$ is a zero divisor if $xwedge y=0$ for some $yin L^*=Lsetminus left{0right}$. The set of all zero divisors is denoted by $Z(L)$. We associate a simple graph $Gamma(L)$ to $L$ with vertex set $Z(L)^*=Z(L)setminus left{0right}$, the set of non-zero zero divisors of $L$ and distinct $x,yin Z(L)^*$ are adjacent if and only if $xwedge y=0$. In this paper, we obtain certain properties and diameter and girth of the zero divisor graph $Gamma(L)$. Also we find a dominating set and the domination number of the zero divisor graph $Gamma(L)$
| Reference Key |
2014atransactions
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | , T. Tamizh Chelvam;Nithya, S.; |
| Journal | transactions on combinatorics |
| Year | 2014 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.