let $r$ be a commutative ring with identity. an ideal $i$ of a ring $r$is called an annihilating ideal if there exists $rin rsetminus {0}$ such that $ir=(0)$ and an ideal $i$ of$r$ is called an essential ideal if $i$ has non-zero intersectionwith every other non-zero ideal of $r$. thesum-annihilating essential ideal graph of $r$, denoted by $mathcal{ae}_r$, isa graph whose vertex set is the set...

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...