English

Unmixedness of some weighted oriented graphs

Combinatorics 2021-10-12 v2 Commutative Algebra

Abstract

Let D=(G,O,w)D=(G,\mathcal{O},w) be a weighted oriented graph whose edge ideal is I(D)I(D). In this paper, we characterize the unmixed property of I(D)I(D) for each one of the following cases: GG is an SCQSCQ graph; GG is a chordal graph; GG is a simplicial graph; GG is a perfect graph; GG has no 44- or 55-cycles; GG is a graph without 33- and 55-cycles; and girth(G)5{\rm girth}(G)\geqslant 5.

Keywords

Cite

@article{arxiv.2003.00931,
  title  = {Unmixedness of some weighted oriented graphs},
  author = {Lourdes Cruz and Yuriko Pitones and Enrique Reyes},
  journal= {arXiv preprint arXiv:2003.00931},
  year   = {2021}
}
R2 v1 2026-06-23T14:00:27.480Z