Monomial ideals of graphs with loops
From MaRDI portal
Publication:2806653
Abstract: We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the polynomial ring related to these graphs modulo such ideals. Moreover we are able to determine the structure of the ideals of vertex covers for the edge ideals associated to the previous classes of graphs which can have loops on any vertex. Lastly, it is showed that these ideals are of linear type.
Recommendations
- Monomial subrings of graphs with loops
- The graph of monomial ideals
- Computer Algebra in Scientific Computing
- Publication:4502608
- scientific article; zbMATH DE number 5064455
- Monomial ideals of weighted oriented graphs
- The monomial ideal of independent sets associated to a graph
- scientific article; zbMATH DE number 5064444
- On monoid graphs
- Monomial and toric ideals associated to Ferrers graphs
Cited in
(7)- scientific article; zbMATH DE number 5064455 (Why is no real title available?)
- On algebraic properties of Veronese bi-type ideals arising from graphs
- Integral closure of bipartite graph ideals
- On the strong persistence property for monomial ideals
- Weakly polymatroidal ideals with applications to vertex cover ideals
- Monomial subrings of graphs with loops
- On Generalization of Cycles and Chordality to Clutters from an Algebraic Viewpoint
This page was built for publication: Monomial ideals of graphs with loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806653)