Unmixedness of some weighted oriented graphs
Combinatorics
2021-10-12 v2 Commutative Algebra
Abstract
Let be a weighted oriented graph whose edge ideal is . In this paper, we characterize the unmixed property of for each one of the following cases: is an graph; is a chordal graph; is a simplicial graph; is a perfect graph; has no - or -cycles; is a graph without - and -cycles; and .
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}
}