A. Roy

most citedChordal graphs, higher independence and vertex decomposable complexes

6 citations · 11 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2021★ 6 cited

Chordal graphs, higher independence and vertex decomposable complexes

Fred M. Abdelmalek, Priyavrat Deshpande, Shuchita Goyal +2

Given a simple undirected graph $G$ there is a simplicial complex $Ind (G)$ , called the independence complex, whose faces correspond to the independent sets of $G$ . This is…

math.CO2020

Standard monomials of $1$ -skeleton ideals of multigraphs

Amit Roy

Given a graph $G$ on the vertex set ${0, 1, \dots, n}$ with the root vertex $0$ , Postnikov and Shapiro associated a monomial ideal $M_{G}$ in the polynomial ring $R=\mathbb…

math.CO2020★ 1 cited

Graded Betti numbers of some circulant graphs

Sonica Anand, Amit Roy

Let $G$ be the circulant graph $C_{n} (S)$ with $S \subseteq {1, 2, \dots, ⌊ \frac{n}{2} ⌋}$ , and let $I (G)$ denote the edge ideal in the polynomial ring $R=\mathbb{K}[x…

math.CO2020★ 1 cited

Standard Monomials of 1-Skeleton Ideals of Graphs and Their Signless Laplace Matrices

Chanchal Kumar, Gargi Lather, Amit Roy

Let $G$ be a (multi) graph on the vertex set $V = {0, 1, \dots, n}$ with root $0$ . The $G$ -parking function ideal $M_{G}$ is a monomial ideal in the polynomial ring $R=\math…

math.CO2020

Integer Sequences and Monomial Ideals

Chanchal Kumar, Amit Roy

Let $S_{n}$ be the set of all permutations of $[n] = {1, \dots, n}$ and let $W$ be the subset consisting of permutations $σ \in S_{n}$ avoiding 132 and 312-patterns…

Chordal graphs, higher independence and vertex decomposable complexes

Standard monomials of 1-skeleton ideals of multigraphs

Graded Betti numbers of some circulant graphs

Standard Monomials of 1-Skeleton Ideals of Graphs and Their Signless Laplace Matrices

Integer Sequences and Monomial Ideals

Standard monomials of $1$ -skeleton ideals of multigraphs