A. Mousivand

activity

20092015

S_{2}

graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

5 papers

math.AC2015★ 1 cited

Circulant $S_{2}$ graphs

Amir Mousivand

Recently, Earl, Vander Meulen, and Van Tuyl characterized some families of Cohen-Macaulay or Buchsbaum circulant graphs discovered by Boros-Gurvich-Milani $c ˇ$ , Brown-…

math.AC2013

A new construction for Cohen-Macaulay graphs

Amir Mousivand, Seyed Amin Seyed Fakhari, Siamak Yassemi

Let $G$ be a finite simple graph on a vertex set $V (G) = {x_{11}, \dots, x_{n 1}}$ . Also let $m_{1}, \dots, m_{n} \geq 2$ be integers and $G_{1}, \dots, G_{n}$ be connected simple graphs…

math.AC2011

Algebraic properties of product of graphs

Amir Mousivand

Let $G$ and $H$ be two simple graphs and let $G * H$ denotes the graph theoretical product of $G$ by $H$ . In this paper we provide some results on graded Betti numbers, Castelnuovo-M…

math.AC2010

Vertex decomposability and regularity of very well-covered graphs

Mohammad Mahmoudi, Amir Mousivand, Marilena Crupi +3

A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V…

math.AC2009

The complement of a connected bipartite graph is vertex decomposable

Mohammad Mahmoudi, Amir Mousivand, Siamak Yassemi

Associated to a simple undirected graph $G$ is a simplicial complex $Δ_{G}$ whose faces correspond to the independent sets of $G$ . A graph $G$ is called vertex decomposable if $Δ_{G}$ …