A note on the zero divisor graph of a lattice
Clicks: 346
ID: 46033
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
30.0
/100
346 views
39 readers
AI Quality Assessment
Not analyzed
Readership in this journal
StarRanked #1 of 4 articles by views in transactions on combinatorics
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
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)$
Abstract Quality Issue:
This abstract appears to be incomplete or contains metadata (114 words).
Try re-searching for a better abstract.
| 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.