On Monday, April 20, 2026, the Department of Mathematics at the College of Computer Science and Mathematics held a seminar titled “N-idempotent divisor graph of commutative rings” presented by Professor Raeda Dawood Mahmoud, Professor Hussam Qasim Mohammed, and Assistant Professor Shaimaa Hatem Ahmed.<\/p>\n
Seminar Summary:<\/p>\n
Let N be a commutative ring with an identity element. In 1999, Anderson established the relationship between ring theory and data theory by defining the zero divisor graph of commutative rings. In 2022, Anderson and Padowi defined the zero divisor graph of a commutative subgroup as a verticeal graph where the two different vertices are adjacent if and only if N is a commutative (multilateral) subgroup, N is the zero divisor set of N, and N is a positive integer. Therefore, every N is a sub-graph induced by N. In 2022, Mohammed and Shukr defined the isometric graph as a graph with vertices and , where and are adjacent if and only if , where . In this work, we presented and studied the isometric graph of order for as a simple graph with vertices and , where and are adjacent if and only if , where is an isometric element of non-unitary nature. Therefore, every isometric graph induced by .<\/p>\n","protected":false},"excerpt":{"rendered":"
On Monday, April 20, 2026, the Department of Mathematics at the College of Computer Science and Mathematics held a seminar titled “N-idempotent divisor graph of commutative rings” presented by Professor Raeda Dawood Mahmoud, Professor Hussam Qasim Mohammed, and Assistant Professor Shaimaa Hatem Ahmed. Seminar Summary: Let N be a commutative ring with an identity element. In 1999, Anderson established the relationship between ring theory and data theory by defining the zero divisor graph of commutative rings. In 2022, Anderson and Padowi defined the zero divisor graph of a commutative subgroup as a verticeal graph where the two different vertices are adjacent [Read More]<\/a><\/p>\n","protected":false},"author":24,"featured_media":42993,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[24],"tags":[],"class_list":["post-42992","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-lectures"],"_links":{"self":[{"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/posts\/42992","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/users\/24"}],"replies":[{"embeddable":true,"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/comments?post=42992"}],"version-history":[{"count":1,"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/posts\/42992\/revisions"}],"predecessor-version":[{"id":42994,"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/posts\/42992\/revisions\/42994"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/media\/42993"}],"wp:attachment":[{"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/media?parent=42992"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/categories?post=42992"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/uomosul.edu.iq\/en\/computerscience\/wp-json\/wp\/v2\/tags?post=42992"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}