Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Symbolic powers in weighted oriented graphs

    https://doi.org/10.1142/S0218196721500260Cited by:8 (Source: Crossref)

    Let D be a weighted oriented graph with the underlying graph G when vertices with non-trivial weights are sinks and I(D),I(G) be the edge ideals corresponding to D and G, respectively. We give an explicit description of the symbolic powers of I(D) using the concept of strong vertex covers. We show that the ordinary and symbolic powers of I(D) and I(G) behave in a similar way. We provide a description for symbolic powers and Waldschmidt constant of I(D) for certain classes of weighted oriented graphs. When D is a weighted oriented odd cycle, we compute reg(I(D)(s)/I(D)s) and prove regI(D)(s)regI(D)s and show that equality holds when there is only one vertex with non-trivial weight.

    Communicated by J. McCullough

    AMSC: 05C22, 13D02, 13D45, 05C25, 05C38, 05E40