2019
DOI: 10.1216/rmj-2019-49-4-1391
|View full text |Cite
|
Sign up to set email alerts
|

Projective dimension and regularity of edge ideals of some weighted oriented graphs

Abstract: In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals associated to three special types of vertex-weighted oriented m-partite graphs. These formulas are functions of the weight and number of vertices. We also give some examples to show that these formulas are related to direction selection and the weight of vertices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

8
22
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(30 citation statements)
references
References 42 publications
(111 reference statements)
8
22
0
Order By: Relevance
“…In order to obtain more general results, we investigate the Betti numbers and provide recursive formulas for these invariants. With this approach, we successfully recover several results from [19] and suggest an explanation for the nature of regularity formulas given in [5].…”
Section: Introductionsupporting
confidence: 57%
See 3 more Smart Citations
“…In order to obtain more general results, we investigate the Betti numbers and provide recursive formulas for these invariants. With this approach, we successfully recover several results from [19] and suggest an explanation for the nature of regularity formulas given in [5].…”
Section: Introductionsupporting
confidence: 57%
“…Edge ideals of weighted oriented graphs are fairly new objects in the combinatorial commutative algebra community and there have been a few papers investigating algebraic properties and invariants of these objects (see [5,12,14,18,19]). There has been an extensive literature on the edge ideals of (unweighted, unoriented) graphs, and one of the reasons for such fruitful outcomes is due to the squarefree nature of edge ideals of graphs.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…In this paper, we consider the edge ideal I(D) of a weighted oriented graph D. In this case, there exist integers b and t 0 such that reg (I t ) = (w + 1)t + b for all t ≥ t 0 , where w = max {w(x) | x ∈ V (D)}. We also derive some exact formulas for projective dimension and regularity of powers of the edge ideals of some weighted oriented graphs (see, for example, [34,35,36,37,38]). To the best of our knowledge, there is a few results about projective dimension and regularity of powers of the edge ideal for a weighted oriented graph.…”
Section: Introductionmentioning
confidence: 99%