Monomial ideals of graphs with loops

DOI10.2478/AICU-2013-0010zbMATH Open1349.05162arXiv1110.6616OpenAlexW1978671018MaRDI QIDQ2806653FDOQ2806653

Authors: Maurizio Imbesi, Monica La Barbiera 

Publication date: 18 May 2016

Published in: Analele Științifice ale Universității Al. I. Cuza din Iași. Serie Nouă. Matematică (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1110.6616

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

zbMATH Keywords

linear quotientsgraphs with loopsideals of linear typeideals of vertex covers

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Associated graded rings of ideals (Rees ring, form ring), analytic spread and related topics (13A30) Dimension theory, depth, related commutative rings (catenary, etc.) (13C15)

Cited In (8)

• Weakly polymatroidal ideals with applications to vertex cover ideals
• On algebraic properties of Veronese bi-type ideals arising from graphs
• On the strong persistence property for monomial ideals
• Vertex covers in graphs with loops
• Monomial subrings of graphs with loops
• Integral closure of bipartite graph ideals
• On Generalization of Cycles and Chordality to Clutters from an Algebraic Viewpoint
• Title not available (Why is that?)

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)