<abstract xmlns="http://www.w3.org/1999/xhtml"><p> We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal. </p></abstract>

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.

On the binomial edge ideals of block graphs

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"On the binomial edge ideals of block graphs"}

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have...

On the binomial edge ideals of block graphs

Pubblicato online: 21 set 2017

Pagine: 149 - 158

Ricevuto: 04 feb 2015

Accettato: 02 mar 2015

DOI: https://doi.org/10.1515/auom-2016-0033

Parole chiave
Binomial edge ideals, regularity, depth

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

On the binomial edge ideals of block graphs

Pubblicato online: 21 set 2017

Pagine: 149 - 158

Ricevuto: 04 feb 2015

Accettato: 02 mar 2015

DOI: https://doi.org/10.1515/auom-2016-0033

Parole chiaveBinomial edge ideals, regularity, depth

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Parole chiave
Binomial edge ideals, regularity, depth