Related papers: The Annihilating-Ideal Graph of a Ring

Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_R$ of $R$ is a graph in which the vertex set comprises of set of all nonzero proper ideals of $R$ and two vertices $I$ and $K$ are adjacent if and only if…

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

Let $ir(G)$ and $\gamma(G)$ be the irredundance number and the domination number of a graph $G$, respectively. A graph $G$ is called irredundance perfect if $ir(H)=\gamma(H)$ for every induced subgraph $H$ of $G$. The subclass of $P_6$-free…

A group $G$ of permutations of a set $\Omega$ is {\em primitive} if it acts transitively on $\Omega$, and the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. A graph $\Gamma$ is {\em primitive}…

In this paper we show that if $I$ is an ideal of a commutative semigroup $C$ such that the separator $SepI$ of $I$ is not empty then the factor semigroup $S=C/P_I$ ($P_I$ is the principal congruence on $C$ defined by $I$) satisfies…

For any finite abelian group $G$ and commutative unitary ring $R$, by $R[G]$ we denote the group algebra over $R$. Let $T=(g_1,\ldots,g_{\ell})$ be a sequence over the group $G$. We say $T$ is algebraically zero-sum free over R if…

Let $R$ be a commutative ring and $\Gamma$ be an infinite discrete group. The algebraic $K$-theory of the group ring $R[\Gamma]$ is an important object of computation in geometric topology and number theory. When the group ring is…

The domination polynomial (the total domination polynomial) of a graph $ G $ of order $ n $ is the generating function of the number of dominating sets (total dominating sets) of $ G $ of any size. In this paper, we study the domination…

By definition, a group $G$ is quasi-perfect, if $G$ is perfect or the commutator subgroup of $G$ is perfect. In this note we give a description of quasi-perfect Dyer groups by properties of the corresponding Dyer graphs.

Given a compact surface $\Sigma$ with boundary and a relation $\Gamma$ on $\pi_0(\partial\Sigma)$, we define the prescribed arc graph $\mathscr A(\Sigma,\Gamma)$ to be the full subgraph of the arc graph $\mathscr A(\Sigma)$ containing only…

In this paper we study some of the basic properties of a graph which is constructed from the equivalence classes of non-zero zero-divisors determined by annihilator ideals of a poset. In particular, we demonstrate how this graph helps in…

Let $G$ be a $2$-generated group. The generating graph $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the…

Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$. In this paper we show that if a graph $G$ has a DIM, then $\chi(G) \leqslant 3$. Also, it is shown that if $G$ is a…

Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_{R}$ of $R$, is a graph with a vertex set consisting of all nonzero proper ideals of \textit{R} and two vertices $I$ and $K$ are adjacent if and only if $I+ K$…

The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. A basic property of the critical ideals of graphs asserts that the graphs with at most k trivial critical ideals,…

The Gruenberg--Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is defined as follows. The vertex set of $\Gamma(G)$ is the set of all prime divisors of the order of $G$. Two distinct primes $r$ and $s$ regarded as…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

A finite group is called $\psi$-divisible iff $\psi(H)|\psi(G)$ for any subgroup $H$ of a finite group $G$. Here, $\psi(G)$ is the sum of element orders of $G$. For now, the only known examples of such groups are the cyclic ones of…

In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.