Monomial Ideals of Weighted Oriented Graphs
Keyword(s):
Let $I=I(D)$ be the edge ideal of a weighted oriented graph $D$ whose underlying graph is $G$. We determine the irredundant irreducible decomposition of $I$. Also, we characterize the associated primes and the unmixed property of $I$. Furthermore, we give a combinatorial characterization for the unmixed property of $I$, when $G$ is bipartite, $G$ is a graph with whiskers or $G$ is a cycle. Finally, we study the Cohen–Macaulay property of $I$.
2019 ◽
Vol 29
(03)
◽
pp. 535-559
◽
Keyword(s):
2013 ◽
Vol 87
(3)
◽
pp. 514-526
◽
Keyword(s):
2015 ◽
Vol 24
(05)
◽
pp. 1550025
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 58
(3)
◽
pp. 276-292
2018 ◽
Vol 55
(3)
◽
pp. 345-352