Fatemeh Mohammadi

ARITHMETICAL RANK OF THE CYCLIC AND BICYCLIC GRAPHS

We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex, the arithmetical rank equals the projective dimension of the corresponding quotient ring.

Weakly polymatroidal ideals with applications to vertex cover ideals

In this paper we extend the concept of weakly polymatroidal ideals to monomial ideals which are not necessarily generated in one degree, and show that any ideal in this class has linear quotients. As an application we study s ome vertex cover ideals of weighted hypergraphs.

Powers of the Vertex Cover Ideal of a Chordal Graph

In this article, Cohen–Macaulay chordal graphs and generalized star graphs are studied to show that all powers of the vertex cover ideal of such graphs have linear quotients. Moreover, it is shown that the Alexander dual of the clique complex of any chordal graph is vertex decomposable.

RESOLUTION OF UNMIXED BIPARTITE GRAPHS

For an unmixed bipartite graph

On the Arithmetical Rank of the Edge Ideals of Some Graphs

G

Accuracy enhancement of 3D profilometric human face reconstruction using undecimated wavelet analysis

we consider the lattice of vertex covers

Application of Digital Phase Shift Moiré to Reconstruction of Human Face

mathcal{L}_G

3D Machine Vision Employing Optical Phase Shift Moiré

and compute depth, projective dimension and extremal Betti-numbers of

Three-dimensional surface topography based on digital fringe projection

R/I(G)

An Algebraic Criterion for the Choosability of Graphs

in terms of this lattice.