| Autor: |
Jayanthan, A.V., Sarkar, Rajib |
| Předmět: |
|
| Zdroj: |
Algebra Colloquium; Sep2022, Vol. 29 Issue 3, p443-452, 10p |
| Abstrakt: |
In this article, we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique. As a consequence, we obtain an upper bound for the regularity of binomial edge ideal of a cactus graph. We also identify a certain subclass attaining the upper bound. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
