<p>Defining a graph that establishes a connection between ring theory and graph theory is an interesting area of research in mathematics. In this paper, we establish a relationship between graphs and seminearrings, which are generalizations of rings. We propose an equiprime graph of a seminearring <i>S</i>, which handles both the binary operations of <i>S</i>. It’s interesting to see that the classical zero-divisor graph is a special case of an equiprime (e-prime) graph. Further, other prime graphs are studied in detail, and related results are presented. Additionally, we examine the conditions under which the ideal becomes a vertex cover of the e-prime graph and the dominating set of its line graph.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Equiprime graph of a seminearring

  • Prakash Padoor,
  • Babushri Srinivas Kedukodi,
  • Syam Prasad Kuncham,
  • Kavitha Koppula

摘要

Defining a graph that establishes a connection between ring theory and graph theory is an interesting area of research in mathematics. In this paper, we establish a relationship between graphs and seminearrings, which are generalizations of rings. We propose an equiprime graph of a seminearring S, which handles both the binary operations of S. It’s interesting to see that the classical zero-divisor graph is a special case of an equiprime (e-prime) graph. Further, other prime graphs are studied in detail, and related results are presented. Additionally, we examine the conditions under which the ideal becomes a vertex cover of the e-prime graph and the dominating set of its line graph.