Symbolic defects of edge ideals of unicyclic graphs

preprint2022arXivOpen access

Abstract

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let GG be a unicyclic graph with a unique odd cycle and I=I(G)I=I(G) be its edge ideal. We compute the exact values of all symbolic defects of II 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 II. We classify the class of unicyclic graphs when some power of maximal ideal annihilates I(s)/Is I^{(s)}/I^s for any fixed s s . Also for those class of graphs, we compute the Hilbert function of the module I(s)/IsI^{(s)}/I^s for all s.s.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.