Abstract
We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let be a unicyclic graph with a unique odd cycle and be its edge ideal. We compute the exact values of all symbolic defects of 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 . We classify the class of unicyclic graphs when some power of maximal ideal annihilates for any fixed . Also for those class of graphs, we compute the Hilbert function of the module for all
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.