Certain Bounds of Regularity of Elimination Ideals on Operations of Graphs | Zendy

Zongming Lv | Zendy; Muhammad Junaid Ali Junjua | Zendy; Muhammad Tajammal Tahir | Zendy; Khurram Shabbir | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Certain Bounds of Regularity of Elimination Ideals on Operations of Graphs

Author(s) -

Zongming Lv,

Muhammad Junaid Ali Junjua,

Muhammad Tajammal Tahir,

Khurram Shabbir

Publication year - 2021

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2021/3697430

Subject(s) - graph , mathematics , combinatorics , type (biology) , degree (music) , discrete mathematics , physics , ecology , acoustics , biology

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 K n ∨ C m and K n ∗ C m by using the DVE method. We further compute sharp upper bound for Castelnuovo–Mumford regularity of elimination ideals associated to these families of graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research