Certain Bounds of Regularity of Elimination Ideals on Operations of Graphs

Zongming Lv, Muhammad Junaid Ali Junjua, Muhammad Tajammal Tahir and Khurram Shabbir

Mathematical Problems in Engineering, 2021, vol. 2021, 1-8

Abstract:

Elimination ideals are regarded as a special type of Borel type ideals, obtained from degree sequence of a graph, introduced by Anwar and Khalid. In this paper, we compute graphical degree stabilities of and by using the DVE method. We further compute sharp upper bound for Castelnuovo–Mumford regularity of elimination ideals associated to these families of graphs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/3697430.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/3697430.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3697430

DOI: 10.1155/2021/3697430

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().