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 defects of edge ideals of unicyclic graphs

    https://doi.org/10.1142/S0219498823500998Cited by:1 (Source: Crossref)

    We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let G be a unicyclic graph with a unique odd cycle and I=I(G) be its edge ideal. We compute the exact values of all symbolic defects of I using the concept of minimum edge cover for an induced subgraph in a graph. We describe one method to find the quasi-polynomial associated with the symbolic defects of edge ideal I. We classify the class of unicyclic graphs when some power of maximal ideal annihilates I(s)/Is for any fixed s. Also for those class of graphs, we compute the Hilbert function of the module I(s)/Is for all s.

    Communicated by T. H. Ha

    AMSC: 13F20, O5C25