Abstract
Let [Formula: see text] be a weighted oriented graph and [Formula: see text] denote the corresponding edge ideal. In this paper, we give a combinatorial characterization of [Formula: see text] which has a linear resolution. As a consequence, we prove that if [Formula: see text] is the edge ideal of a weighted oriented graph [Formula: see text], then [Formula: see text] has a linear resolution if and only if all powers of [Formula: see text] have a linear resolution. Also, we prove that if [Formula: see text] is a weighted oriented graph and [Formula: see text] for all [Formula: see text], then [Formula: see text] has a linear resolution if and only if all powers of [Formula: see text] have linear quotients. We provide a lower bound for the regularity of powers of edge ideals of weighted oriented graphs in terms of induced matching. Finally, we obtain a general upper bound for the regularity of edge ideals of weighted oriented graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
