Let $I$ be a proper ideal of a commutative semiring $R$ and let $P(I)$ be the set of all elements of $R$ that are not prime to $I$. In this paper, we investigate the total graph of $R$ with respect to $I$, denoted by $T(Gamma_{I} (R))$. It is the (undirected) graph with elements of $R$ as vertices, and for distinct $x, y in R$, the vertices $x$ and $y$ are adjacent if and only if $x + y in P(I)...

In this article, we give several generalizations of the concept of annihilating ideal graph over a commutative ring with identity to modules. Weobserve that over a commutative ring $R$, $Bbb{AG}_*(_RM)$ isconnected and diam$Bbb{AG}_*(_RM)leq 3$. Moreover, if $Bbb{AG}_*(_RM)$ contains a cycle, then $mbox{gr}Bbb{AG}_*(_RM)leq 4$. Also for an $R$-module $M$ with$Bbb{A}_*(M)neq S(M)setminus {0}$, $...

A simple graphoidal cover of a semigraph is such that any two paths in have atmost one end vertex common. The minimum cardinality called the covering number and denoted by . acyclic an In this paper we find for wheel semigraph, unicycle zero-divisor graph.

In this paper, we show that Q n is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Q n is a divisor graph iff k ≥ n− 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn) k is not a divisor graph, where 2 ≤ k ≤ ⌈ 2 ⌉ − 1.

Recently, Katre et al. introduced the concept of coprime index a graph. They asked to characterize graphs for which is same as clique number. In this paper, we partially solve problem. fact, prove that number and zero-divisor graph an ordered set ring Zpn coincide. Also, it proved annihilating ideal graphs, co-annihilating comaximal commutative rings can be realized specially constructed posets...