A Generalization Of Co-Maximal Graph Of Commutative Rings

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS(2019)

引用 3|浏览2
暂无评分
摘要
Let R be a commutative ring with 1. Let G(R) be a graph with vertices as elements of R, where two distinct vertices a and b are adjacent if and only if aR+bR = eR for some non-zero idempotent e in R. In this paper, we establish a relation between completeness of the graph G(R) and regularity of the ring R. For a finite commutative ring R with 1, we show that the chromatic number of G(R) is equal to the number of regular elements in R. Moreover, we characterize some graph theoretic properties of G(R) and finally we characterize Eulerian property of the graph G(R).
更多
查看译文
关键词
Complete graph, chromatic number, Eulerian graph, regular ring, local ring
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要