JOURNAL ARTICLE

n-Absorbing number for some monomial ideals.

  • Published In: Journal of Algebra & Its Applications, 2025, v. 24, n. 12. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Zahedzadeh, Mojgan; Soleyman Jahan, Ali 3 of 3

Abstract

We compute the absorbing number of the edge ideals of special graphs such as complete graphs, path graphs, and cycle graphs. We also compute the absorbing number for other monomial ideals. In special cases, we show that the length of a prime filtration of a monomial ideal I is an upper bound for its absorbing number. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Journal of Algebra & Its Applications. 2025/10, Vol. 24, Issue 12, p1
  • Document Type:Article
  • Subject Area:History
  • Publication Date:2025
  • ISSN:0219-4988
  • DOI:10.1142/S0219498825502901
  • Accession Number:185309033
  • Copyright Statement:Copyright of Journal of Algebra & Its Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.