Binomial Edge Ideals of Graphs
Copyright policy )Binomial Edge Ideals of Graphs
We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of a closed graph.
- Institute for Research in Fundamental Sciences Iran (Islamic Republic of)
- Amirkabir University of Technology Iran (Islamic Republic of)
linear resolutions, Structure, classification theorems for modules and ideals in commutative rings, Combinatorial aspects of commutative algebra, Syzygies, resolutions, complexes in associative algebras, Castelnuovo-Mumford regularity, binomial edge ideals
linear resolutions, Structure, classification theorems for modules and ideals in commutative rings, Combinatorial aspects of commutative algebra, Syzygies, resolutions, complexes in associative algebras, Castelnuovo-Mumford regularity, binomial edge ideals
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).24 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!