Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...

In this paper, we describe the primitive ideal space of the $C^*$-algebra $C^*(mathcal G)$  associated to the ultragraph $mathcal{G}$. We investigate the structure of the closed ideals of the quotient ultragraph $  C^* $-algebra  $C^*left(mathcal G/(H,S)right)$ which contain no nonzero set projections and then we characterize all non gauge-invariant primitive ideals. Our results generalize the ...

Let $M$ be a module over a commutative ring $R$ and let $N$ be a proper submodule of $M$. The total graph of $M$ over $R$ with respect to $N$, denoted by $T(Gamma_{N}(M))$, have been introduced and studied in [2]. In this paper, A generalization of the total graph $T(Gamma_{N}(M))$, denoted by $T(Gamma_{N,I}(M))$ is presented, where $I$ is an ideal of $R$. It is the graph with all elements of $...

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.

In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.