Projective dimension and regularity of edge ideals of some weighted oriented graphs (Q2323934)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Projective dimension and regularity of edge ideals of some weighted oriented graphs
scientific article

    Statements

    Projective dimension and regularity of edge ideals of some weighted oriented graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2019
    0 references
    A vertex-weighted oriented graph is a triplet \(D=(V(D),E(D),w)\), where \(V(D)=\{x_1,\dots,x_n\}\) is the vertex set, \(E(D)\) is the edge set and \(w:V(D)\rightarrow\mathbb{N}\) is a weight function. The edge ideal of \(D\), denoted by \(I(D)\), is the ideal of the polynomial ring \(S=k[x_1,x_2,\dots,x_n]\) which is generated by monomials \(\{x_ix_j^{w_j}|x_ix_j\in E(D)\}\). In the present article, the authors consider edge ideals of vertex-weighted oriented graphs and they provide some formulas for the projective dimension and the regularity of edge ideals associated to special vertex weighted rooted graphs. In fact, it is shown that if \(D\) satisfies one of the conditions \begin{itemize} \item[(i)] \(D\) is a weighted oriented star graph; \item[(ii)] \(D\) is a weighted oriented rooted forest such that \(w(x)\geq 2\) if \(d(x)\neq 1\); \item[(iii)] \(D\) is a weighted oriented rooted cycle such that \(w(x)\geq 2\) for every vertex \(x\in V(D)\); \end{itemize} then the projective dimension and regularity of the edge ideal is calculated by the following formulas: \(\operatorname{pd}(I(D)=|E(D)|-1;\ \ \operatorname{reg}(I(D))=\sum_{x\in V(D)}w(x)-|E(D)|+1\).
    0 references
    projective dimension
    0 references
    regularity
    0 references
    weighted rooted forest
    0 references
    weighted oriented cycle
    0 references
    edge ideal
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references