A. Nikseresht

activity

20162024

most citedChordality of Clutters with Vertex Decomposable Dual and Ascent of Clutters

14 citations · 42 across the 14 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019★ 3 cited

Some Combinatorial Characterizations of Gorenstein Graphs with Independence Number Less than Four

Mohammad Reza Oboudi, Ashkan Nikseresht

Let $α = α (G)$ be the independence number of a simple graph $G$ with $n$ vertices and $I (G)$ be its edge ideal in $S = K [x_{1}, \dots, x_{n}]$ . If $S / I (G)$ is Gorenstein, the graph $G$ is…

math.AC2019★ 1 cited

On Gorenstein Circulant Graphs and Gorenstein SQC Graphs

Ashkan Nikseresht, Mohammad Reza Oboudi

We characterize some graphs with a Gorenstein edge ideal. In particular, we show that if $G$ is a circulant graph with vertex degree at most four or a circulant graph of the form $…

math.AC2019★ 6 cited

Trung's Construction and the Charney-Davis Conjecture

Ashkan Nikseresht, Mohammad Reza Oboudi

We consider a construction by which we obtain a simple graph $T (H, v)$ from a simple graph $H$ and a non-isolated vertex $v$ of $H$ . We call this construction "Trung's cons…